# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964535 | UmairAhmadMirza | Gondola (IOI14_gondola) | C++14 | 52 ms | 6480 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>
#include <gondola.h>
using namespace std;
int const mod=1e9+9;
long long power(long long a,long long b){
if(b==0)
return 1;
if(b==1)
return a;
long long pw=power(a,b/2);
pw%=mod;
pw*=pw;
pw%=mod;
if(b&1)
pw*=a;
pw%=mod;
return pw;
}
int valid(int n, int inputSeq[]){
map<int,bool> mp;
deque<int> d;
int k=n+1;
for (int i = 0; i < n; ++i)//check unique
{
d.push_back(inputSeq[i]);
if(mp[inputSeq[i]]){
return 0;
}
mp[inputSeq[i]]=1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |