# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52437 | shoemakerjo | Gondola (IOI14_gondola) | C++14 | 72 ms | 10068 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;
#define ll long long
#define pii pair<int, int>
const int mod = 1000000009;
int modpow(int base, int p) {
if (p == 0) return 1;
if (p & 1) {
int tmp = modpow(base, p-1);
return (tmp*1LL*base)%mod;
}
int tmp = modpow(base, p/2);
return (tmp*1LL*tmp)%mod;
}
int valid(int n, int inputSeq[])
{
int minval = n+1;
int minind = 0;
set<int> seen;
for (int i = 0; i < n; i++) {
if (inputSeq[i] < minval) {
minval = inputSeq[i];
minind = i;
}
if (seen.count(inputSeq[i])> 0) return 0;
seen.insert(inputSeq[i]);
}
Compilation message (stderr)
# | 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... |