Submission #1153637


Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const int INF = 2000000000;
using namespace std;

int main(){
    int n, q;
    cin >> n >> q;

    pair<int, string> p[55];
    rep(i,n){
        int a;
        string s;
        cin >> a >> s;
        p[i + 1] = make_pair(a,s);
    }
    p[0] = make_pair(0,"kogakubu10gokan");
    p[n + 1] = make_pair(INF,"error");

    rep(i,n + 1){
        //cout << p[i].first <<' ' << p[i + 1].first<< endl;
        if(p[i].first <= q && q < p[i + 1].first){
            cout << p[i].second << endl;
            return 0;
        }
    }
}

Submission Info

Submission Time
Task A - 旧総合研究7号館
User noy72
Language C++14 (GCC 5.4.1)
Score 100
Code Size 874 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