Submission #3569570
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li time_[111];
string s[111];
int main() {
li n, q;
cin >> n >> q;
rin{
cin >> time_[i] >> s[i];
}
li res = -1;
rin{
if (time_[i] > q) {
break;
}
res = i;
}
cout << (res < 0 ? "kogakubu10gokan" : s[res]) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 旧総合研究7号館 |
User |
sueki |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2483 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_small_0.txt, 10_small_1.txt, 10_small_2.txt, 10_small_3.txt, 10_small_4.txt, 10_small_5.txt, 10_small_6.txt, 10_small_7.txt, 10_small_8.txt, 10_small_9.txt, 20_large_0.txt, 20_large_1.txt, 20_large_2.txt, 20_large_3.txt, 20_large_4.txt, 20_large_5.txt, 20_large_6.txt, 20_large_7.txt, 20_large_8.txt, 20_large_9.txt, 30_random_0.txt, 30_random_1.txt, 30_random_2.txt, 30_random_3.txt, 30_random_4.txt, 30_random_5.txt, 30_random_6.txt, 30_random_7.txt, 30_random_8.txt, 30_random_9.txt, 40_max_0.txt, 40_max_1.txt, 40_max_2.txt, 40_max_3.txt, 40_max_4.txt, 40_max_5.txt, 40_max_6.txt, 40_max_7.txt, 40_max_8.txt, 40_max_9.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_00.txt |
AC |
1 ms |
256 KB |
00_sample_01.txt |
AC |
1 ms |
256 KB |
00_sample_02.txt |
AC |
1 ms |
256 KB |
10_small_0.txt |
AC |
1 ms |
256 KB |
10_small_1.txt |
AC |
1 ms |
256 KB |
10_small_2.txt |
AC |
1 ms |
256 KB |
10_small_3.txt |
AC |
1 ms |
256 KB |
10_small_4.txt |
AC |
1 ms |
256 KB |
10_small_5.txt |
AC |
1 ms |
256 KB |
10_small_6.txt |
AC |
1 ms |
256 KB |
10_small_7.txt |
AC |
1 ms |
256 KB |
10_small_8.txt |
AC |
1 ms |
256 KB |
10_small_9.txt |
AC |
1 ms |
256 KB |
20_large_0.txt |
AC |
1 ms |
256 KB |
20_large_1.txt |
AC |
1 ms |
256 KB |
20_large_2.txt |
AC |
1 ms |
256 KB |
20_large_3.txt |
AC |
1 ms |
256 KB |
20_large_4.txt |
AC |
1 ms |
256 KB |
20_large_5.txt |
AC |
1 ms |
256 KB |
20_large_6.txt |
AC |
1 ms |
256 KB |
20_large_7.txt |
AC |
1 ms |
256 KB |
20_large_8.txt |
AC |
1 ms |
256 KB |
20_large_9.txt |
AC |
1 ms |
256 KB |
30_random_0.txt |
AC |
1 ms |
256 KB |
30_random_1.txt |
AC |
1 ms |
256 KB |
30_random_2.txt |
AC |
1 ms |
256 KB |
30_random_3.txt |
AC |
1 ms |
256 KB |
30_random_4.txt |
AC |
1 ms |
256 KB |
30_random_5.txt |
AC |
1 ms |
256 KB |
30_random_6.txt |
AC |
1 ms |
256 KB |
30_random_7.txt |
AC |
1 ms |
256 KB |
30_random_8.txt |
AC |
1 ms |
256 KB |
30_random_9.txt |
AC |
1 ms |
256 KB |
40_max_0.txt |
AC |
1 ms |
256 KB |
40_max_1.txt |
AC |
1 ms |
256 KB |
40_max_2.txt |
AC |
1 ms |
256 KB |
40_max_3.txt |
AC |
1 ms |
256 KB |
40_max_4.txt |
AC |
1 ms |
256 KB |
40_max_5.txt |
AC |
1 ms |
256 KB |
40_max_6.txt |
AC |
1 ms |
256 KB |
40_max_7.txt |
AC |
1 ms |
256 KB |
40_max_8.txt |
AC |
1 ms |
256 KB |
40_max_9.txt |
AC |
1 ms |
256 KB |