結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー shimomireshimomire
提出日時 2016-10-14 23:53:51
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 68 ms / 4,000 ms
コード長 6,305 bytes
コンパイル時間 1,276 ms
コンパイル使用メモリ 133,740 KB
実行使用メモリ 10,192 KB
最終ジャッジ日時 2024-11-22 07:23:06
合計ジャッジ時間 4,938 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
9,856 KB
testcase_01 AC 55 ms
9,768 KB
testcase_02 AC 48 ms
9,860 KB
testcase_03 AC 53 ms
9,644 KB
testcase_04 AC 52 ms
9,716 KB
testcase_05 AC 51 ms
9,752 KB
testcase_06 AC 68 ms
9,936 KB
testcase_07 AC 55 ms
9,884 KB
testcase_08 AC 50 ms
9,616 KB
testcase_09 AC 47 ms
9,860 KB
testcase_10 AC 46 ms
9,656 KB
testcase_11 AC 48 ms
9,168 KB
testcase_12 AC 47 ms
9,648 KB
testcase_13 AC 41 ms
9,628 KB
testcase_14 AC 45 ms
9,580 KB
testcase_15 AC 41 ms
9,076 KB
testcase_16 AC 50 ms
9,228 KB
testcase_17 AC 51 ms
9,516 KB
testcase_18 AC 51 ms
9,736 KB
testcase_19 AC 41 ms
9,668 KB
testcase_20 AC 43 ms
9,560 KB
testcase_21 AC 42 ms
9,516 KB
testcase_22 AC 48 ms
9,392 KB
testcase_23 AC 44 ms
9,620 KB
testcase_24 AC 40 ms
9,440 KB
testcase_25 AC 45 ms
9,496 KB
testcase_26 AC 42 ms
9,272 KB
testcase_27 AC 46 ms
9,220 KB
testcase_28 AC 40 ms
9,728 KB
testcase_29 AC 46 ms
9,460 KB
testcase_30 AC 3 ms
6,816 KB
testcase_31 AC 4 ms
6,820 KB
testcase_32 AC 53 ms
10,192 KB
testcase_33 AC 52 ms
9,324 KB
testcase_34 AC 45 ms
9,904 KB
testcase_35 AC 4 ms
6,820 KB
testcase_36 AC 3 ms
6,816 KB
testcase_37 AC 4 ms
6,820 KB
testcase_38 AC 4 ms
6,820 KB
testcase_39 AC 5 ms
6,820 KB
testcase_40 AC 4 ms
6,820 KB
testcase_41 AC 8 ms
6,820 KB
testcase_42 AC 7 ms
6,816 KB
testcase_43 AC 7 ms
6,816 KB
testcase_44 AC 7 ms
6,816 KB
testcase_45 AC 5 ms
6,816 KB
testcase_46 AC 10 ms
6,816 KB
testcase_47 AC 10 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define LINE()    cerr<< " (L" << __LINE__ << ")"

class range {
private:
	struct Iter{
		int v;
		int operator*(){return v;}
		bool operator!=(Iter& itr) {return v < itr.v;}
		void operator++() {++v;}
	};
	Iter i, n;
public:
	range(int n) : i({0}), n({n}) {}
	range(int i, int n) : i({i}), n({n}) {}
	Iter& begin() {return i;}
	Iter& end() {return n;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){is>>p.first>>p.second;return is;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){is >> get<0>(t);return is;}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){is >> get<0>(t) >> get<1>(t);return is;}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){is >>get<0>(t)>>get<1>(t)>>get<2>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);return is;}
template<typename T> istream& operator >> (istream& is,vector<T>& as){REP(i,as.size())is >>as[i];return is;}

//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}

//input
char tmp[1000];
#define nextInt(n) scanf("%d",&n)
#define nextLong(n) scanf("%lld",&n) //I64d
#define nextDouble(n) scanf("%lf",&n)
#define nextChar(n) scanf("%c",&n)
#define nextString(n) scanf("%s",tmp);n=tmp

// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};
template<> long double INF<long double>(){return 1e16;};

template<class T> T EPS(){assert(false);};
template<> int EPS<int>(){return 1;};
template<> ll EPS<ll>(){return 1LL;};
template<> double EPS<double>(){return 1e-8;};
template<> long double EPS<long double>(){return 1e-8;};

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

class Main{
	public:
	void run(){
		int N,K;cin >> N >> K;

		vector<vector<tuple<int,int,int>>> us(100050);
		for(int i:range(N)){
			int s,p,u;cin >> s >> p >> u;
			us[u].push_back(make_tuple(-s,p,i));
		}
		for(int i:range(100050)) sort(ALL(us[i]));
		priority_queue<tuple<int,int,int,int>,vector<tuple<int,int,int,int>>,greater<tuple<int,int,int,int>>> que;
		for(int i:range(100050)){
			int r=0;
			for(tuple<int,int,int> p:us[i]){
				que.push(make_tuple(get<0>(p),r++,get<1>(p),get<2>(p)));
			}
		}

		while(!que.empty() && K-- > 0){
			cout << get<3>(que.top()) <<"\n";
			que.pop();
		}
		cout << flush;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}
0