oj.uz

답안 #138746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138746 2019-07-30T09:34:00 Z Mahmoud_Adel 곤돌라 (IOI14_gondola) C++14
60 / 100
 21 ms 5496 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6+5, mod = 1e9+9;
int mark[N], mep[N];
int valid(int n, int inputSeq[])
{
	for(int i=0; i<n; i++)
	{
		if(mark[inputSeq[i]]) return 0;
		else mark[inputSeq[i]] = 1;
	}
	int j = -1;
	for(int i=0; i<n; i++) if(inputSeq[i] > 0 && inputSeq[i] <= n) j = i;
	if(j == -1) return 1;
	for(int i=0; i<n; i++)
	{
		int id = (i+j)%n, jd = (i+j+1)%n;
		if(inputSeq[jd] > n) inputSeq[jd] = inputSeq[id]%n + 1;
		if(inputSeq[jd] != inputSeq[id]%n + 1) return 0;
	}
	return 1;
}

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

int replacement(int n, int inputSeq[], int replacementSeq[])
{
	memset(mep, 0, sizeof mep);
	int j = -1, c = n;
	for(int i=0; i<n; i++) if(inputSeq[i] <= n) j  = i;
	if(j == -1)
	{
		for(int i=0; i<n; i++) replacementSeq[inputSeq[i]-n-1] = i+1;
		return n;
	}
	for(int i=0; i<n; i++)
	{
		int id = (i+j) % n, jd = (i+j+1) % n;
		if(inputSeq[jd] > n) c = max(c, inputSeq[jd]), mep[inputSeq[jd]] = inputSeq[id]%n + 1,  inputSeq[jd] = inputSeq[id]%n + 1;
	}
	int last = -1;
	for(int i=c; i>n; i--)
	{
		if(mep[i] && last == -1) last = i;
		if(!mep[i]) 
		replacementSeq[i-n-1] = replacementSeq[last-n-1], replacementSeq[last-n-1] = i;
		else replacementSeq[i-n-1] = mep[i];
	}
	return c-n;
}

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

int countReplacement(int n, int inputSeq[])
{
	int tmp[n];
	for(int i=0; i<n; i++) tmp[i] = inputSeq[i];
	if(!valid(n, inputSeq)) return 0;
	for(int i=0; i<n; i++) inputSeq[i] = tmp[i];
	memset(mep, 0, sizeof mep);
	ll j = -1, c = n;
	for(int i=0; i<n; i++) if(inputSeq[i] <= n) j  = i;
	if(j == -1)
	{
		for(int i=0; i<n; i++)
		{
			c = max(c, (ll)inputSeq[i]);
			mep[inputSeq[i]] = 1;
		}
		ll cnt = 1, cmt=0;
		for(ll i=c; i>n; i--)
		{
			if(!mep[i]) cnt *=  (cmt), cnt %= mod;
			else cmt++;
		}
			return (cnt*n)%mod;
	}
	for(int i=0; i<n; i++)
	{
		ll id = (i+j) % n, jd = (i+j+1) % n;
		if(inputSeq[jd] > n) c = max(c, (ll)inputSeq[jd]),  mep[inputSeq[jd]] = 1;
	}
	ll cnt = 1, cmt=0;
	for(ll i=c; i>n; i--)
	{
		if(!mep[i]) cnt = (cnt%mod * cmt%mod)%mod;
		else cmt++;
	}
	return cnt;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:82:6: warning: unused variable 'id' [-Wunused-variable]
   ll id = (i+j) % n, jd = (i+j+1) % n;
      ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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
6 Correct 10 ms 632 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 12 ms 888 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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
6 Correct 8 ms 636 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 12 ms 888 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 13 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 8 ms 1272 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 15 ms 1108 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Incorrect 5 ms 4216 KB Integer 7 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4248 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Incorrect 5 ms 4216 KB Integer 7 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4188 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4220 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4212 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4220 KB Output is correct
9 Correct 21 ms 5496 KB Output is correct
10 Correct 18 ms 5368 KB Output is correct
11 Correct 12 ms 5112 KB Output is correct
12 Correct 12 ms 4956 KB Output is correct
13 Correct 9 ms 4472 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4188 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 21 ms 5496 KB Output is correct
10 Correct 20 ms 5240 KB Output is correct
11 Correct 14 ms 5112 KB Output is correct
12 Correct 13 ms 4984 KB Output is correct
13 Correct 8 ms 4472 KB Output is correct
14 Runtime error 17 ms 1784 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -