結果
問題 | No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい |
ユーザー | kei |
提出日時 | 2018-12-14 01:27:12 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 141 ms / 4,000 ms |
コード長 | 2,305 bytes |
コンパイル時間 | 4,306 ms |
コンパイル使用メモリ | 185,400 KB |
実行使用メモリ | 9,216 KB |
最終ジャッジ日時 | 2023-10-25 09:47:08 |
合計ジャッジ時間 | 8,048 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
9,100 KB |
testcase_01 | AC | 111 ms
9,164 KB |
testcase_02 | AC | 77 ms
8,244 KB |
testcase_03 | AC | 102 ms
7,240 KB |
testcase_04 | AC | 97 ms
7,156 KB |
testcase_05 | AC | 91 ms
8,312 KB |
testcase_06 | AC | 141 ms
9,216 KB |
testcase_07 | AC | 87 ms
9,140 KB |
testcase_08 | AC | 77 ms
8,640 KB |
testcase_09 | AC | 77 ms
7,040 KB |
testcase_10 | AC | 75 ms
6,860 KB |
testcase_11 | AC | 88 ms
6,860 KB |
testcase_12 | AC | 84 ms
6,860 KB |
testcase_13 | AC | 47 ms
6,860 KB |
testcase_14 | AC | 63 ms
6,860 KB |
testcase_15 | AC | 36 ms
6,856 KB |
testcase_16 | AC | 97 ms
6,856 KB |
testcase_17 | AC | 98 ms
6,860 KB |
testcase_18 | AC | 102 ms
6,860 KB |
testcase_19 | AC | 49 ms
6,860 KB |
testcase_20 | AC | 59 ms
6,860 KB |
testcase_21 | AC | 56 ms
6,860 KB |
testcase_22 | AC | 84 ms
6,860 KB |
testcase_23 | AC | 69 ms
6,860 KB |
testcase_24 | AC | 49 ms
6,860 KB |
testcase_25 | AC | 77 ms
6,860 KB |
testcase_26 | AC | 53 ms
6,856 KB |
testcase_27 | AC | 76 ms
6,856 KB |
testcase_28 | AC | 49 ms
6,860 KB |
testcase_29 | AC | 83 ms
6,856 KB |
testcase_30 | AC | 2 ms
4,348 KB |
testcase_31 | AC | 1 ms
4,348 KB |
testcase_32 | AC | 103 ms
6,872 KB |
testcase_33 | AC | 111 ms
6,876 KB |
testcase_34 | AC | 72 ms
7,564 KB |
testcase_35 | AC | 2 ms
4,348 KB |
testcase_36 | AC | 2 ms
4,348 KB |
testcase_37 | AC | 2 ms
4,348 KB |
testcase_38 | AC | 2 ms
4,348 KB |
testcase_39 | AC | 2 ms
4,348 KB |
testcase_40 | AC | 2 ms
4,348 KB |
testcase_41 | AC | 7 ms
4,348 KB |
testcase_42 | AC | 6 ms
4,348 KB |
testcase_43 | AC | 6 ms
4,348 KB |
testcase_44 | AC | 7 ms
4,348 KB |
testcase_45 | AC | 3 ms
4,348 KB |
testcase_46 | AC | 20 ms
4,348 KB |
testcase_47 | AC | 18 ms
4,348 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/433> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ struct team{ int S,P,U,id; team(int S = 0,int P = 0,int U = 0,int id = 0):S(S),P(P),U(U),id(id){} bool operator < (const team& c1) const{ if(S != c1.S) return S < c1.S; return P > c1.P; } }; template<class Type> Type solve(Type res = Type()){ int N,K; cin >> N >> K; vector<team> T(N); for(int i = 0; i < N;i++){ int S,P,U; cin >> S >> P >> U; T[i] = team(S,P,U,i); } sort(T.rbegin(),T.rend()); map<int,int> ranking; using Item = tuple<int,int,int,int>; priority_queue<Item> pq; for(int i = 0; i < N;i++){ pq.push(Item(T[i].S,-ranking[T[i].U],-T[i].P,T[i].id)); ranking[T[i].U]++; } while(K--){ cout << get<3>(pq.top()) << endl; pq.pop(); } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); solve(0); //cout << fixed << setprecision(15) << solve<ll>() << endl; return 0; }