# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348505 | arnold518 | Queue (CEOI06_queue) | C++14 | 505 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e4;
const int INF = 1e9+100;
int N, Q;
unordered_map<int, int> A;
map<int, int> B;
int getA(int x)
{
if(A.find(x)==A.end()) return x-1;
return A[x];
}
int getB(int x)
{
if(B.find(x)==B.end()) return x+1;
return B[x];
}
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |