oj.uz

Submission #77284

# Submission time Handle Problem Language Result Execution time Memory
77284 2018-09-24T15:37:03 Z MvC Gondola (IOI14_gondola) C++11
20 / 100
 47 ms 8360 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=3e5+50;
const int mod=1e9+7;
using namespace std;
map<int,bool> used;
int valid(int n, int inSeq[])
{
	int start=-1;
	for (int i=0;i<n;i++){
		if (used[inSeq[i]]){
			return 0;
		}
		used[inSeq[i]]=true;
		if (inSeq[i]<=n){
			if (start!=-1 && (n+i-inSeq[i]+1)%n!=start){
				return 0;
			}
			start=(n+i-inSeq[i]+1)%n;
		}
	}
	return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	return 0;
}
int countReplacement(int n, int inputSeq[])
{
	return 0;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    
    return 0;
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 404 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 584 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 684 KB Output is correct
2 Correct 2 ms 752 KB Output is correct
3 Correct 2 ms 752 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 19 ms 2744 KB Output is correct
7 Correct 13 ms 2744 KB Output is correct
8 Correct 35 ms 5528 KB Output is correct
9 Correct 12 ms 5528 KB Output is correct
10 Correct 47 ms 6584 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6584 KB Output is correct
2 Correct 2 ms 6584 KB Output is correct
3 Correct 3 ms 6584 KB Output is correct
4 Correct 2 ms 6584 KB Output is correct
5 Correct 2 ms 6584 KB Output is correct
6 Correct 19 ms 6584 KB Output is correct
7 Correct 13 ms 6584 KB Output is correct
8 Correct 33 ms 7172 KB Output is correct
9 Correct 13 ms 7172 KB Output is correct
10 Correct 47 ms 8360 KB Output is correct
11 Correct 2 ms 8360 KB Output is correct
12 Correct 2 ms 8360 KB Output is correct
13 Correct 9 ms 8360 KB Output is correct
14 Correct 2 ms 8360 KB Output is correct
15 Correct 16 ms 8360 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

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