Submission #2738026


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define F first
#define S second
#define M 1000000007
P t[100005];
ll ans,c,x=2,k=1,n;
int main(void){
    cin>>n;
    for(int i=0;i<n;i++)cin>>t[i].S>>t[i].F;
    sort(t,t+n,greater<P>());
    c=2*t[1].F;
    for(ll i=2;i<n;i++){
        k=k*i%M;
        ans=(ans*(i+1)%M+(c+M-t[i].F*x%M)%M*t[i].S%M)%M;
        c=(c*(i+2)%M+k*2%M*t[i].F%M)%M;
        x=(x*(i+2)%M+k*2%M)%M;
    }
    cout<<ans<<endl;
}

Submission Info

Submission Time
Task E - 天下一コップ
User nxteru
Language C++14 (GCC 5.4.1)
Score 140
Code Size 533 Byte
Status AC
Exec Time 89 ms
Memory 1792 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 15 / 15 55 / 55 70 / 70
Status
AC × 3
AC × 17
AC × 31
AC × 45
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt
Subtask3 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask2_01.txt AC 2 ms 256 KB
subtask2_02.txt AC 3 ms 256 KB
subtask2_03.txt AC 3 ms 256 KB
subtask2_04.txt AC 3 ms 256 KB
subtask2_05.txt AC 3 ms 256 KB
subtask2_06.txt AC 3 ms 256 KB
subtask2_07.txt AC 3 ms 256 KB
subtask2_08.txt AC 3 ms 256 KB
subtask2_09.txt AC 3 ms 256 KB
subtask2_10.txt AC 3 ms 256 KB
subtask2_11.txt AC 3 ms 256 KB
subtask2_12.txt AC 3 ms 256 KB
subtask2_13.txt AC 3 ms 256 KB
subtask2_14.txt AC 3 ms 256 KB
subtask3_01.txt AC 36 ms 1792 KB
subtask3_02.txt AC 89 ms 1792 KB
subtask3_03.txt AC 86 ms 1792 KB
subtask3_04.txt AC 83 ms 1664 KB
subtask3_05.txt AC 82 ms 1664 KB
subtask3_06.txt AC 80 ms 1664 KB
subtask3_07.txt AC 87 ms 1792 KB
subtask3_08.txt AC 81 ms 1664 KB
subtask3_09.txt AC 81 ms 1664 KB
subtask3_10.txt AC 87 ms 1792 KB
subtask3_11.txt AC 84 ms 1664 KB
subtask3_12.txt AC 87 ms 1792 KB
subtask3_13.txt AC 86 ms 1792 KB
subtask3_14.txt AC 89 ms 1792 KB