oj.uz

Submission #153271

# Submission time Handle Problem Language Result Execution time Memory
153271 2019-09-13T06:52:59 Z arnold518 Gondola (IOI14_gondola) C++14
20 / 100
 22 ms 1656 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int valid(int N, int *A)
{
    int i, j;

    for(i=0; i<N; i++) A[i]--;
    vector<int> S(A, A+N);
    sort(S.begin(), S.end());
    S.erase(unique(S.begin(), S.end()), S.end());
    if(S.size()!=N) return 0;

    int flag=-1;
    for(i=0; i<N; i++)
    {
        if(A[i]>=N) continue;
        int t=(A[i]-i+N)%N;
        if(flag==-1) flag=t;
        else if(flag!=t) return 0;
    }
    return 1;
}

int replacement(int N, int *A, int *B)
{

}

int countReplacement(int N, int *A)
{

}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:19:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(S.size()!=N) return 0;
        ~~~~~~~~^~~
gondola.cpp:13:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
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:40: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 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 10 ms 760 KB Output is correct
7 Correct 21 ms 1656 KB Output is correct
8 Correct 15 ms 1272 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 20 ms 1400 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 10 ms 760 KB Output is correct
7 Correct 21 ms 1528 KB Output is correct
8 Correct 15 ms 1272 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 20 ms 1396 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 22 ms 1528 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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