oj.uz

Submission #140647

# Submission time Handle Problem Language Result Execution time Memory
140647 2019-08-04T03:14:30 Z baluteshih Gondola (IOI14_gondola) C++14
60 / 100
 24 ms 2376 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int valid(int n, int inputSeq[])
{
	int p=min_element(inputSeq,inputSeq+n)-inputSeq;
	vector<int> v(inputSeq,inputSeq+n);
	sort(ALL(v));
	for(int i=0;i+1<n;++i)
		if(v[i]==v[i+1]) return 0;
	if(inputSeq[p]>n) return 1;
	for(int i=p;i<p+n;++i)
		if(inputSeq[i%n]<=n&&inputSeq[i%n]!=inputSeq[p]+i-p)
			return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vector<int> org(n);
	int p=min_element(gondolaSeq,gondolaSeq+n)-gondolaSeq;
	if(gondolaSeq[p]>n)
		for(int i=0;i<n;++i)
			org[i]=i+1;
	else
		for(int i=p;i<p+n;++i)
			org[i%n]=(gondolaSeq[p]+i-p-1)%n+1;
	vector<pii> v;
	for(int i=0;i<n;++i)
		if(gondolaSeq[i]>n)
			v.pb(MP(gondolaSeq[i],i));
	sort(ALL(v));
	int nw=n+1,tp=0;
	for(pii i:v)
	{
		replacementSeq[tp++]=org[i.S];
		while(nw<=i.F)
			replacementSeq[tp++]=nw++;
		--tp;
	}
	return tp;
}

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

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n,inputSeq)) return 0;
	return 1;
}

Subtask #1
5.0 / 5.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 376 KB Output is correct

Subtask #2
5.0 / 5.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 256 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 552 KB Output is correct
7 Correct 20 ms 1016 KB Output is correct
8 Correct 14 ms 888 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 20 ms 1016 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 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 20 ms 1016 KB Output is correct
8 Correct 14 ms 884 KB Output is correct
9 Correct 7 ms 528 KB Output is correct
10 Correct 20 ms 1016 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 21 ms 1016 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 292 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 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 2 ms 296 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 13 ms 1528 KB Output is correct
12 Correct 14 ms 1528 KB Output is correct
13 Correct 18 ms 1524 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 24 ms 2376 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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