oj.uz

Submission #7614

# Submission time Handle Problem Language Result Execution time Memory
7614 2014-08-12T18:01:10 Z dohyun0324 Gondola (IOI14_gondola) C++
10 / 100
 16 ms 3820 KB 
#include "gondola.h"
int ch[100010],visit[250010];
int valid(int n, int inputSeq[])
{
    int i,k=0;
    for(i=0;i<n;i++)
    {
        if(visit[inputSeq[i]]==1) return 0;
        visit[inputSeq[i]]=1;
        if(inputSeq[i]<=n) ch[inputSeq[i]]=i;
    }
    for(i=1;i<=n;i++)
    {
        if(ch[i]!=0 && k==0)
        {
            k=ch[i];
            continue;
        }
        if(k!=0)
        {
            k++;
            if(k>n) k=1;
        }
        if(ch[i]!=0 && k!=ch[i]) return 0;
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3820 KB Output is correct
2 Correct 0 ms 3820 KB Output is correct
3 Correct 0 ms 3820 KB Output is correct
4 Correct 0 ms 3820 KB Output is correct
5 Correct 0 ms 3820 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3820 KB Output is correct
2 Correct 0 ms 3820 KB Output is correct
3 Correct 0 ms 3820 KB Output is correct
4 Correct 0 ms 3820 KB Output is correct
5 Correct 0 ms 3820 KB Output is correct
6 Correct 4 ms 3820 KB Output is correct
7 Correct 8 ms 3820 KB Output is correct
8 Correct 12 ms 3820 KB Output is correct
9 Correct 4 ms 3820 KB Output is correct
10 Correct 16 ms 3820 KB Output is correct

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3820 KB Output is correct
2 Correct 0 ms 3820 KB Output is correct
3 Correct 0 ms 3820 KB Output is correct
4 Correct 0 ms 3820 KB Output is correct
5 Correct 0 ms 3820 KB Output is correct
6 Correct 4 ms 3820 KB Output is correct
7 Correct 12 ms 3820 KB Output is correct
8 Correct 4 ms 3820 KB Output is correct
9 Correct 4 ms 3820 KB Output is correct
10 Correct 8 ms 3820 KB Output is correct
11 Correct 0 ms 3820 KB Output is correct
12 Incorrect 0 ms 3820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3820 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -