Submission #2038566


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int N = 100010;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
ostream& operator<<(ostream& o,P p){return o<<"("<<p.first<<","<<p.second<<")";}
istream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}
ostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?" ":"")<<t;return o;}
istream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}
void prArr(auto a,string s=" "){int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}


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

  vector<int>Y(n+1);
  vector<string> str(n+1);
  Y[0] = 0;
  str[0] = "kogakubu10gokan";
  for(int i=1;i<=n;i++) cin>>Y[i]>>str[i];

  string ans;
  for(int i=0;i<=n;i++){
    if(Y[i] == q) ans = str[i];
    if(i+1<=n && Y[i] < q && Y[i+1] > q) ans = str[i];
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

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

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 40
WA × 3
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 WA 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 WA 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 WA 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