oj.uz

답안 #138762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138762 2019-07-30T09:59:46 Z Mahmoud_Adel 곤돌라 (IOI14_gondola) C++14
60 / 100
 27 ms 6648 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];
ll power(ll a, ll b)
{
	if(!b) return 1;
	ll temp = power(a, b/2);
	temp = (temp*temp)%mod;
	if(b%2) temp *= a, temp %= mod;
	return temp;
}
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=n+1; i<c; i++)
	{
		if(mep[i]) replacementSeq[i-n-1] = mep[i];
		else replacementSeq[i-n-1] = mep[c], last = i;
	}
	if(last != -1) replacementSeq[c-n-1] = last;
	else replacementSeq[c-n-1] = mep[c];
	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;
	vector<ll> vec;
	for(int i=0; i<n; i++) if(inputSeq[i] <= n) j  = i;
	else vec.push_back(inputSeq[i]);
	ll ans = 1;
	vec.push_back(n);
	sort(vec.begin(), vec.end());
	for(int i=0; i<vec.size()-1; i++)
	{
		ll tmp = power((ll)vec.size()-i-1, vec[i+1]-vec[i]-1);
		ans = (ans%mod * tmp%mod)%mod;
	}
	return (ans*(j==-1? n:1))%mod;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:79:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<vec.size()-1; i++)
               ~^~~~~~~~~~~~~
gondola.cpp:72:13: warning: unused variable 'c' [-Wunused-variable]
  ll j = -1, c = 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 380 KB Output is correct
5 Correct 2 ms 504 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 380 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 14 ms 1528 KB Output is correct
8 Correct 12 ms 1144 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 14 ms 1528 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 888 KB Output is correct
7 Correct 14 ms 1528 KB Output is correct
8 Correct 12 ms 1272 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 14 ms 1400 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 9 ms 1528 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 16 ms 1660 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 6 ms 4216 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 6 ms 4240 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 4220 KB Output is correct
6 Incorrect 5 ms 4216 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.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 6 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Incorrect 6 ms 4216 KB Output isn't correct
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 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 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 4220 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4188 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 4344 KB Output is correct
9 Correct 25 ms 6644 KB Output is correct
10 Correct 21 ms 6260 KB Output is correct
11 Correct 12 ms 5624 KB Output is correct
12 Correct 14 ms 5472 KB Output is correct
13 Correct 7 ms 4600 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4220 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 5 ms 4220 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 6 ms 4264 KB Output is correct
6 Correct 6 ms 4216 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 27 ms 6648 KB Output is correct
10 Correct 22 ms 6280 KB Output is correct
11 Correct 14 ms 5624 KB Output is correct
12 Correct 15 ms 5496 KB Output is correct
13 Correct 8 ms 4728 KB Output is correct
14 Runtime error 20 ms 2680 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -