oj.uz

Submission #86933

# Submission time Handle Problem Language Result Execution time Memory
86933 2018-11-28T15:57:12 Z antimirage Gondola (IOI14_gondola) C++17
55 / 100
 26 ms 4464 KB 
#include "gondola.h"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 3e5 + 5;

int u[N], sz, mx, pos, ind[N], ar[N], n;

deque <pair <int, int> > vec;

int valid(int N, int x[])
{
	n = N;
	for (int i = 0; i < n; i++)
	{
		if (u[x[i]] > 0)
			return 0;
		u[x[i]] = i + 1;
	}
	for (int i = 1; i < n; i++)	
	{
		if ( u[i] != 0 && u[i + 1] != 0 && ((u[i] - 1) + 1) % n != u[i + 1] - 1)
			return 0;
	}
	if ( u[n] != 0 && u[1] != 0 && ((u[n] - 1) + 1) % n != u[1] - 1)
		return 0;
		
	return 1;
}	
int replacement(int n, int a[], int ans[])
{
	for (int i = 0; i < n; i++)
		mx = max(a[i], mx);
		
	for (int i = 0; i < n; i++)
	{
		if(a[i] > n)
			vec.pb( mk(a[i], i) );
		else
			pos = (i - (a[i] - 1) + n) % n;
	}
	sort( all(vec) );
	ind[pos] = ++sz;
	
	for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n)
		ind[i] = ++sz;
	
	sz = 0;
	for (int i = n + 1; i <= mx; i++)
	{
		ans[sz++] = ind[ vec[0].second ];
		ind[ vec[0].second ] = i;
		if ( vec[0].first == i )
			vec.pop_front();
	}
	return sz;
}	

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
/**
4
3
3 1 4
**/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 2 ms 456 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 7 ms 952 KB Output is correct
7 Correct 15 ms 1220 KB Output is correct
8 Correct 12 ms 1220 KB Output is correct
9 Correct 8 ms 1220 KB Output is correct
10 Correct 15 ms 1220 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1220 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1220 KB Output is correct
4 Correct 2 ms 1220 KB Output is correct
5 Correct 2 ms 1220 KB Output is correct
6 Correct 9 ms 1220 KB Output is correct
7 Correct 14 ms 1220 KB Output is correct
8 Correct 12 ms 1220 KB Output is correct
9 Correct 5 ms 1220 KB Output is correct
10 Correct 26 ms 1220 KB Output is correct
11 Correct 2 ms 1220 KB Output is correct
12 Correct 2 ms 1220 KB Output is correct
13 Correct 9 ms 1476 KB Output is correct
14 Correct 2 ms 1476 KB Output is correct
15 Correct 15 ms 1476 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1476 KB Output is correct
2 Correct 2 ms 1476 KB Output is correct
3 Correct 2 ms 1476 KB Output is correct
4 Correct 2 ms 1476 KB Output is correct
5 Correct 2 ms 1476 KB Output is correct
6 Correct 2 ms 1476 KB Output is correct
7 Correct 2 ms 1476 KB Output is correct
8 Correct 2 ms 1476 KB Output is correct
9 Correct 2 ms 1476 KB Output is correct
10 Correct 3 ms 1476 KB Output is correct
11 Correct 14 ms 1800 KB Output is correct
12 Correct 18 ms 2396 KB Output is correct
13 Correct 19 ms 3168 KB Output is correct
14 Correct 13 ms 3168 KB Output is correct
15 Correct 25 ms 4464 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4464 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 2 ms 4464 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 2 ms 4464 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 2 ms 4464 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -