Submission #2038703


Source Code Expand

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

#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

template <typename T> using vector2d = vector<vector<T>>;

// clang-format off
template <typename T> void sort(vector<T> &v) { sort(all(v)); }
// ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }
// ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }

struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup;

inline int64_t in() { int64_t x = 0; cin >> x; return x; }
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

signed main(int argc, char *argv[]) {
  int n = in(), q = in();

  int ansy = 0;
  string ans = "kogakubu10gokan";

  for (int i = 0; i < n; ++i) {
    int y = in();
    string s;
    cin >> s;

    if (y >= q && ansy > y) {
      ansy = y;
      ans = s;
    }
  }

  cout << ans << endl;
}

Submission Info

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

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 3
WA × 40
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 WA 1 ms 256 KB
00_sample_01.txt WA 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 WA 1 ms 256 KB
10_small_2.txt WA 1 ms 256 KB
10_small_3.txt AC 1 ms 256 KB
10_small_4.txt WA 1 ms 256 KB
10_small_5.txt WA 1 ms 256 KB
10_small_6.txt WA 1 ms 256 KB
10_small_7.txt WA 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 WA 1 ms 256 KB
20_large_1.txt WA 1 ms 256 KB
20_large_2.txt WA 1 ms 256 KB
20_large_3.txt WA 1 ms 256 KB
20_large_4.txt WA 1 ms 256 KB
20_large_5.txt WA 1 ms 256 KB
20_large_6.txt WA 1 ms 256 KB
20_large_7.txt WA 1 ms 256 KB
20_large_8.txt WA 1 ms 256 KB
20_large_9.txt WA 1 ms 256 KB
30_random_0.txt WA 1 ms 256 KB
30_random_1.txt WA 1 ms 256 KB
30_random_2.txt WA 1 ms 256 KB
30_random_3.txt WA 1 ms 256 KB
30_random_4.txt WA 1 ms 256 KB
30_random_5.txt WA 1 ms 256 KB
30_random_6.txt WA 1 ms 256 KB
30_random_7.txt WA 1 ms 256 KB
30_random_8.txt WA 1 ms 256 KB
30_random_9.txt WA 1 ms 256 KB
40_max_0.txt WA 1 ms 256 KB
40_max_1.txt WA 1 ms 256 KB
40_max_2.txt WA 1 ms 256 KB
40_max_3.txt WA 1 ms 256 KB
40_max_4.txt WA 1 ms 256 KB
40_max_5.txt WA 1 ms 256 KB
40_max_6.txt WA 1 ms 256 KB
40_max_7.txt WA 1 ms 256 KB
40_max_8.txt WA 1 ms 256 KB
40_max_9.txt WA 1 ms 256 KB