結果
問題 | No.628 Tagの勢い |
ユーザー | s0j1san |
提出日時 | 2021-06-08 20:57:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 7,366 bytes |
コンパイル時間 | 2,828 ms |
コンパイル使用メモリ | 233,528 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-27 03:52:30 |
合計ジャッジ時間 | 3,858 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 3 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 4 ms
5,248 KB |
testcase_13 | AC | 5 ms
5,248 KB |
testcase_14 | AC | 5 ms
5,248 KB |
testcase_15 | AC | 5 ms
5,248 KB |
testcase_16 | AC | 3 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> #pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") //#include <boost/multiprecision/cpp_int.hpp> //#include <boost/multiprecision/cpp_dec_float.hpp> using namespace std; //namespace mpp = boost::multiprecision; //#include<atcoder/all> //#include<atcoder/segtree> //#include<atcoder/lazysegtree> //#include<atcoder/scc> //#include<atcoder/mincostflow>; //using namespace atcoder; using dou =long double; string yes="yes"; string Yes="Yes"; string YES="YES"; string no="no"; string No="No"; string NO="NO"; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; typedef pair<ll,ll> PL; typedef std::vector<std::vector<int>> VV; typedef std::vector<std::vector<ll>> VVL; //ll mod = 998244353ll; const ll mod = 1000000007ll; //ll mod; //const ll mod = 3; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} #define rep(i, n) for(ll i = 0; i < (ll)(n); i++) //#define rep(i, n) for(int i = 0; i < (int)(n); i++) #define brep(n) for(int bit=0;bit<(1<<n);bit++) #define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++) #define erep(i,container) for (auto &i : container) #define itrep(i,container) for (auto i : container) #define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--) #define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++) #define reprep(i,j,h,w) rep(i,h)rep(j,w) #define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i]; #define pb push_back //#define pb emplace_back #define pf push_front #define query int qq;std::cin >> qq;rep(qqq,qq) #define lb lower_bound #define ub upper_bound #define fi first #define se second #define itn int #define mp make_pair //#define sum(a) accumulate(all(a),0ll) #define keta fixed<<setprecision #define kout(d) std::cout << keta(10)<< d<< std::endl; #define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl; #define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a)) //#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n)) #define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a))); #define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) )); //#define case std::cout <<"Case #" <<qqq+1<<":" #define RES(a,iq,jq) a.resize(iq);rep(iii,iq)a[iii].resize(jq); #define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){a[ii][jj].resize(k);}; #define res resize #define as assign #define ffor for(;;) #define ppri(a,b) std::cout << a<<" "<<b << std::endl #define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl #define ppppri(a,b,c,d) std::cout << a<<" "<<b <<" "<< c<<' '<<d<<std::endl #define aall(x,n) (x).begin(),(x).begin()+(n) #define SUMI(a) accumulate(all(a),0) #define SUM(a) accumulate(all(a),0ll) #define stirng string #define gin(a,b) int a,b;std::cin >> a>>b;a--;b--; #define popcount __builtin_popcountll #define permu(a) next_permutation(all(a)) #define aru(a,d) a.find(d)!=a.end() #define nai(a,d) a.find(d)==a.end() #define ansprint1(a,b,c) std::cout << a<<','<<b <<','<<c << std::endl; #define ansprint2(a,b,c,d,e) std::cout << a<<','<<b <<','<<c <<','<<d<<','<<e<< std::endl; //typedef long long T; ll ceili(ll a,ll b){ return ((a+b-1)/b); } const int INF = 2000000000; //const ll INF64 =922330720854775807ll; //const ll INF64 = 4223372036854775807ll; //const ll INF64 = 9223372036854775807ll; //const ll INF64 = 243'000'000'000'000'000'0; const ll INF64 = 2430000000000000000; const ll MOD = 1000000007ll; //const ll MOD = 998244353ll; //const ll MOD = 1000003ll; //const ll MOD = 3; const ll OD = 1000000000000007ll; const dou pi=3.141592653589793; //mod=MOD; long long modpow(long long a, long long n, ll MOD) { long long res = 1; a%=MOD; while (n > 0) { if (n & 1) res = res * a % MOD; a = a * a % MOD; n >>= 1; } return res; } vector< ll > divisor(ll n) { vector< ll > ret; for(ll i = 1; i * i <= n; i++) { if(n % i == 0) { ret.push_back(i); if(i * i != n) ret.push_back(n / i); } } sort(begin(ret), end(ret)); return (ret); } map< ll, ll > prime_factor(ll n) { map< ll, ll > ret; for(ll i = 2; i * i <= n; i++) { while(n % i == 0) { ret[i]++; n /= i; } } if(n != 1) ret[n] = 1; return ret; } bool IsPrime(ll num) { if (num < 2ll) return false; else if (num == 2ll) return true; else if (num % 2ll == 0ll) return false; double sqrtNum = sqrt(num); for (ll i = 3ll; i <= sqrtNum; i += 2ll) { if (num % i == 0ll) { return false; } } return true; } struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; //メモ //unordered_set,mapを使うときは //unordered_set<type, custom_hash >などとする //↑https://codeforces.com/blog/entry/62393 //COMinit()周りにfac[max]があるので使うといいかも //2^30=1073741824 //2^60=11522921504606846976 int main(){ map<string,int>ma; query{ int nnn; std::cin >> nnn; int n,p; std::cin >> n>>p; VEC(string ,s,n); erep(i,s){ ma[i]+=p; } } set<pair<int,string>>st; erep(i,ma){ st.insert(mp(-i.se,i.fi)); } int c=0; while(c<10&&st.size()){ auto p=*st.begin(); ppri(p.se,-p.fi); st.erase(st.begin()); c++; } }