結果
問題 | No.1708 Quality of Contest |
ユーザー | blackyuki |
提出日時 | 2021-10-15 21:24:33 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,728 bytes |
コンパイル時間 | 2,198 ms |
コンパイル使用メモリ | 210,160 KB |
実行使用メモリ | 17,388 KB |
最終ジャッジ日時 | 2024-09-17 17:12:14 |
合計ジャッジ時間 | 7,803 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 5 ms
6,944 KB |
testcase_04 | AC | 5 ms
6,944 KB |
testcase_05 | AC | 5 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,940 KB |
testcase_07 | AC | 5 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 245 ms
17,388 KB |
testcase_10 | AC | 211 ms
12,736 KB |
testcase_11 | AC | 243 ms
11,052 KB |
testcase_12 | AC | 247 ms
11,948 KB |
testcase_13 | AC | 237 ms
10,260 KB |
testcase_14 | AC | 253 ms
12,324 KB |
testcase_15 | AC | 258 ms
15,396 KB |
testcase_16 | AC | 255 ms
15,076 KB |
testcase_17 | AC | 243 ms
12,792 KB |
testcase_18 | AC | 244 ms
13,048 KB |
testcase_19 | AC | 244 ms
13,944 KB |
testcase_20 | AC | 242 ms
12,616 KB |
testcase_21 | AC | 255 ms
13,172 KB |
testcase_22 | AC | 249 ms
12,392 KB |
testcase_23 | AC | 256 ms
15,184 KB |
testcase_24 | AC | 209 ms
8,876 KB |
testcase_25 | AC | 207 ms
9,016 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)#define pb emplace_back#define lb(v,k) (lower_bound(all(v),(k))-v.begin())#define ub(v,k) (upper_bound(all(v),(k))-v.begin())#define fi first#define se second#define pi M_PI#define PQ(T) priority_queue<T>#define SPQ(T) priority_queue<T,vector<T>,greater<T>>#define dame(a) {out(a);return 0;}#define decimal cout<<fixed<<setprecision(15);#define all(a) a.begin(),a.end()#define rsort(a) {sort(all(a));reverse(all(a));}#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}#define popcnt __builtin_popcountlltypedef long long ll;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> PP;typedef tuple<ll,ll,ll,ll> PPP;using vi=vector<ll>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vvvvi=vector<vvvi>;using vp=vector<P>;using vvp=vector<vp>;using vb=vector<bool>;using vvb=vector<vb>;const ll inf=1001001001001001001;const ll INF=1001001001;const ll mod=998244353;const double eps=1e-10;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}template<class T> void yesno(T b){if(b)out("yes");else out("no");}template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}int main(){ll n,m,x;cin>>n>>m>>x;vvi g(m);rep(i,n){ll a,b;cin>>a>>b;g[b-1].pb(a);}vi al;rep(i,m){rsort(g[i]);if(g[i].size()){al.pb(g[i][0]+x);REP(j,1,g[i].size())al.pb(g[i][j]);}}rsort(al);vi rui(n+1);rep(i,n)rui[i+1]=rui[i]+al[i];ll ans=0;ll k;cin>>k;rep(i,k){ll a;cin>>a;ans+=rui[a];}out(ans);}