Submission #1281279

#TimeUsernameProblemLanguageResultExecution timeMemory
1281279khoavn2008Memory (IOI10_memory)C++20
100 / 100
2 ms404 KiB
#include <bits/stdc++.h> #include "grader.h" #include "memory.h" using namespace std; #define ll int #define ld long double #define FOR(i,l,r) for(ll i = (l), _r = (r); i <= _r; i++) #define FORNG(i,r,l) for(ll i = (r), _l = (l); i >= _l; i--) #define REP(i,r) for(ll i = 0, _r = (r); i < _r; i++) #define endl '\n' #define fi first #define se second #define pb push_back #define size(v) ((ll)(v).size()) #define all(v) (v).begin(),(v).end() #define MASK(x) (1LL << (x)) #define BIT(x,i) (((x) >> (i)) & 1) const ll MOD = 1e9 + 7, N = 1e6 + 10, INF = 1e18, LOG = 21; ll pos1[25],pos2[25]; void play(){ FOR(i,1,50){ char x = faceup(i); if(pos1[x - 'A'])pos2[x - 'A'] = i; else pos1[x - 'A'] = i; } REP(i,25)faceup(pos1[i]), faceup(pos2[i]); }

Compilation message (stderr)

memory.cpp:19:45: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const ll MOD = 1e9 + 7, N = 1e6 + 10, INF = 1e18, LOG = 21;
      |                                             ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...