結果
問題 | No.1708 Quality of Contest |
ユーザー |
![]() |
提出日時 | 2021-10-15 21:51:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 3,720 bytes |
コンパイル時間 | 2,996 ms |
コンパイル使用メモリ | 230,800 KB |
最終ジャッジ日時 | 2025-01-25 00:46:16 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC optimize("inline")#include<bits/stdc++.h>using namespace std;void*wmem;char memarr[96000000];template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );(*arr)=(T*)(*mem);(*mem)=((*arr)+x);}template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){walloc1d(arr, x2-x1, mem);(*arr) -= x1;}template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){sort(a, a+N);}template<class T1, class T2> void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){int i;pair<T1, T2>*arr;walloc1d(&arr, N, &mem);for(i=(0);i<(N);i++){arr[i].first = a[i];arr[i].second = b[i];}sort(arr, arr+N);for(i=(0);i<(N);i++){a[i] = arr[i].first;b[i] = arr[i].second;}}template<class T1> void rsortA_L(int N, T1 a[], void *mem = wmem){sortA_L(N, a, mem);reverse(a, a+N);}template<class T1, class T2> void rsortA_L(int N, T1 a[], T2 b[], void *mem = wmem){sortA_L(N, a, b, mem);reverse(a, a+N);reverse(b, b+N);}inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}inline int rd_int(void){int x;rd(x);return x;}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}int main(){int e98WHCEY, i;wmem = memarr;int N;rd(N);int M;rd(M);int X;rd(X);int A[N];int B[N];int s[N+1] = {};int chk[M] = {};long long res = 0;{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);rd(B[Lj4PdHRW]);B[Lj4PdHRW] += (-1);}}int cTE1_r3A = rd_int();for(e98WHCEY=(0);e98WHCEY<(cTE1_r3A);e98WHCEY++){s[rd_int()]++;}for(i=(N)-1;i>=(0);i--){s[i] += s[i+1];}rsortA_L(N,A,B);for(i=(0);i<(N);i++){if(!chk[B[i]]){A[i] += X;chk[B[i]] = 1;}}rsortA_L(N,A);for(i=(0);i<(N);i++){res += (long long) A[i] * s[i+1];}wt_L(res);wt_L('\n');return 0;}// cLay version 20210926-1// --- original code ---// int @N, @M, @X, A[N], B[N], s[N+1] = {}, chk[M] = {};// ll res = 0;// rd((A,B--)(N));// REP(rd_int()) s[rd_int()]++;// rrep(i,N) s[i] += s[i+1];// rsortA(N,A,B);// rep(i,N) if(!chk[B[i]]) A[i] += X, chk[B[i]] = 1;// rsortA(N,A);// rep(i,N) res += (ll) A[i] * s[i+1];// wt(res);