oj.uz

Submission #31690

# Submission time Handle Problem Language Result Execution time Memory
31690 2017-08-31T11:13:09 Z top34051 Gondola (IOI14_gondola) C++14
10 / 100
 16 ms 5140 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define maxn 100005

int n;
int p[maxn], a[maxn];
int vis[250005];

void init(int N, int data[]) {
    int i;
    n = N;
    for(i=0;i<n;i++) p[i] = data[i];
}

bool check(int x,int val) {
    int i;
    for(i=0;i<n;i++) if(p[(x+i)%n]<=n && p[(x+i)%n]!=(val+i-1)%n+1) return 0;
    return 1;
}

int valid(int N, int data[]) {
    int i;
    init(N, data);
    for(i=0;i<n;i++) if(p[i]<=n) return check(i,p[i]);
    memset(vis,0,sizeof(vis));
    for(i=0;i<n;i++) {
        vis[p[i]]++;
        if(vis[p[i]]>1) return 0;
    }
    return 1;
}

int replacement(int N, int data[], int res[]) {
}

int countReplacement(int N, int data[]) {
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:35:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:38: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 5140 KB Output is correct
2 Correct 0 ms 5140 KB Output is correct
3 Correct 0 ms 5140 KB Output is correct
4 Correct 0 ms 5140 KB Output is correct
5 Correct 0 ms 5140 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5140 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5140 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5140 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5140 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 5140 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 5140 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 5140 KB Output isn't correct
2 Halted 0 ms 0 KB -