oj.uz

Submission #28911

# Submission time Handle Problem Language Result Execution time Memory
28911 2017-07-17T17:55:43 Z top34051 Gondola (IOI14_gondola) C++14
25 / 100
 13 ms 4364 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int cnt[250005];

int valid(int n, int p[]) {
    int i,x;
    x = 0;
    for(i=0;i<n;i++) if(p[x]>p[i]) x = i;
    for(i=0;i<n;i++) {
        cnt[p[i]]++;
        if(cnt[p[i]]>1) return 0;
    }
    for(i=0;i<n;i++) if(p[(x+i)%n] <= n && p[(x+i)%n] != p[x]+i) return 0;
    return 1;
}

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

int replacement(int n, int p[], int res[]) {
    if(!valid(n,p)) return 0;
    int i,j,mx = 0;
    for(i=0;i<n;i++) mx = max(mx, p[i]);
    for(i=1,j=0;i<=mx;i++) if(!cnt[i]) res[j++] = i;
    return j;
}

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

int countReplacement(int n, int inputSeq[]) {
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4364 KB Output is correct
2 Correct 0 ms 4364 KB Output is correct
3 Correct 0 ms 4364 KB Output is correct
4 Correct 0 ms 4364 KB Output is correct
5 Correct 0 ms 4364 KB Output is correct
6 Correct 3 ms 4364 KB Output is correct
7 Correct 13 ms 4364 KB Output is correct
8 Correct 6 ms 4364 KB Output is correct
9 Correct 3 ms 4364 KB Output is correct
10 Correct 9 ms 4364 KB Output is correct
11 Correct 0 ms 4364 KB Output is correct
12 Correct 0 ms 4364 KB Output is correct
13 Correct 6 ms 4364 KB Output is correct
14 Correct 0 ms 4364 KB Output is correct
15 Correct 6 ms 4364 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4364 KB Output isn't correct
2 Halted 0 ms 0 KB -