Submission #2325591


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-6;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

const int64 mod = 1777777777;
using PIC = pair<int32, char>;

int main(void){
	int32 N, Q;
	string s = "kogakubu10gokan";
	cin >> N >> Q;
	REP(i, N){
		int32 a; string t;
		cin >> a >> t;
		if(a <= Q) s = t;
	}
	cout << s << endl;
}

Submission Info

Submission Time
Task A - 旧総合研究7号館
User maze1230
Language C++14 (GCC 5.4.1)
Score 100
Code Size 895 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 43
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