oj.uz

Submission #288643

# Submission time Handle Problem Language Result Execution time Memory
288643 2020-09-01T17:34:51 Z shayan_p Gondola (IOI14_gondola) C++17
20 / 100
 52 ms 5524 KB 
#include<bits/stdc++.h>
#include "gondola.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

const int maxn = 1e5 + 10, mod = 1e9 + 7;

int valid(int n, int inp[]){
    int pos[n];
    fill(pos, pos + n, -1);
    set<int> st;
    for(int i = 0; i < n; i++){	
	--inp[i];
	if(inp[i] < 0)
	    return 0;
	if(st.count(inp[i]))
	    return 0;
	st.insert(inp[i]);	    
	if(inp[i] < n)
	    pos[inp[i]] = i;
    }
    int lst = -1;
    for(int i = 0; i < n; i++){
	if(pos[i] != -1){
	    if(lst == -1)
		lst = i;
	    if((lst - i + n) % n != (pos[lst] - pos[i] + n) % n)
		return 0;
	}
    }
    for(int i = 0; i < n; i++){
	if(pos[i] != -1){
	    if(lst == -1)
		lst = i;
	    if((lst - i + n) % n != (pos[lst] - pos[i] + n) % n)
		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 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 16 ms 2560 KB Output is correct
7 Correct 17 ms 1656 KB Output is correct
8 Correct 33 ms 4600 KB Output is correct
9 Correct 10 ms 1664 KB Output is correct
10 Correct 38 ms 5376 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 16 ms 2560 KB Output is correct
7 Correct 16 ms 1536 KB Output is correct
8 Correct 33 ms 4600 KB Output is correct
9 Correct 10 ms 1664 KB Output is correct
10 Correct 38 ms 5376 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 20 ms 2432 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 52 ms 5524 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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