# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102425 | ansol4328 | Gondola (IOI14_gondola) | C++11 | 42 ms | 2484 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 "gondola.h"
#include<stack>
#include<utility>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int m2[100005];
bool exist[250005];
int res[250005], origin[100005];
const ll MOD=1e9+9;
int valid(int N, int *M)
{
int val=M[0], idx=0;
for(int i=0 ; i<N ; i++) m2[i]=M[i];
sort(m2,m2+N);
for(int i=1 ; i<N ; i++)
{
if(m2[i]==m2[i-1]) return 0;
}
for(int i=1 ; i<N ; i++)
{
if(val>M[i]) val=M[i], idx=i;
}
if(val>N) return 1;
int nxt=val;
# | 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... |