oj.uz

답안 #284213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284213 2020-08-27T03:22:51 Z Bill_00 곤돌라 (IOI14_gondola) C++14
55 / 100
 24 ms 9088 KB 
#include <stdlib.h>
#include "gondola.h"
#include <bits/stdc++.h>
#define MOD 1000000009
#define ll long long
using namespace std;
long long pow(long long a,long long b){
	if(b==1) return a;
	long long c=1;
	if(b%2==1) c=a;
	long long d=pow(a,b/2);
	return ((d*d)%MOD*c)%MOD;
}
int valid(int n, int a[])
{
	int k[250000]={0};
	int y[250000]={0},d=0;
	for(int i=0;i<n;i++){
		k[a[i]]++;
	}
	for(int i=0;i<n;i++){
		if(k[a[i]]>1) return 0;
	}
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			if(y[(a[i]-i+n)%n]==0) d++;
			y[(a[i]-i+n)%n]++;
		}
	}
	if(d<=1) return 1;
	return 0;
	
}

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

int replacement(int n, int a[], int replacementSeq[])
{
	int y[100000]={0};
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			y[(a[i]-i+n)%n]++;
		}
	}
	int e=0;
	for(int i=0;i<n;i++){
		e=max(e,y[i]);
	}
	return n-e;
}

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

int countReplacement(int n, int a[])
{
	long long e=0,k[250000]={0};
	long long y[250000]={0},d=0;
	vector<long long>v;
	for(int i=0;i<n;i++){
		k[a[i]]++;
	}
	v.push_back((ll)n);
	for(int i=0;i<n;i++){
		if(k[a[i]]>1) return 0;
	}
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			e++;
			if(y[(a[i]-i+n)%n]==0) d++;
			y[(a[i]-i+n)%n]++;
		}
		else v.push_back((ll)a[i]);
	}
	if(d>1) return 0;
	if(d==1 && e==(ll)n) return 1;
	sort(v.begin(),v.end());
	e=(ll)n-e;
	long long ans=1;
	for(long long i=1;i<v.size();i++){
		long long p=(ll)v[i]-(ll)v[i-1]-(ll)1;
		if(p==(ll)0) continue;
		ans=(ans*pow((ll)(e-i+1),p))%MOD;
	}
	if(e==(long long)n){
		ans=(ans*(ll)n)%MOD;
	}
	return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:79:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |  for(long long i=1;i<v.size();i++){
      |                    ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 8 ms 2560 KB Output is correct
7 Correct 15 ms 2688 KB Output is correct
8 Correct 13 ms 2688 KB Output is correct
9 Correct 5 ms 2432 KB Output is correct
10 Correct 14 ms 2688 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 2 ms 2304 KB Output is correct
6 Correct 8 ms 2592 KB Output is correct
7 Correct 15 ms 2688 KB Output is correct
8 Correct 13 ms 2688 KB Output is correct
9 Correct 5 ms 2432 KB Output is correct
10 Correct 15 ms 2688 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 2 ms 2304 KB Output is correct
13 Correct 8 ms 2560 KB Output is correct
14 Correct 2 ms 2304 KB Output is correct
15 Correct 18 ms 2680 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 768 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 768 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 768 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 3 ms 4224 KB Output is correct
3 Correct 3 ms 4224 KB Output is correct
4 Correct 3 ms 4224 KB Output is correct
5 Correct 3 ms 4224 KB Output is correct
6 Correct 3 ms 4224 KB Output is correct
7 Correct 3 ms 4224 KB Output is correct
8 Correct 3 ms 4224 KB Output is correct
9 Correct 21 ms 5244 KB Output is correct
10 Correct 18 ms 5244 KB Output is correct
11 Correct 9 ms 4864 KB Output is correct
12 Correct 10 ms 4864 KB Output is correct
13 Correct 5 ms 4352 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 3 ms 4224 KB Output is correct
3 Correct 3 ms 4224 KB Output is correct
4 Correct 3 ms 4224 KB Output is correct
5 Correct 3 ms 4224 KB Output is correct
6 Correct 3 ms 4224 KB Output is correct
7 Correct 3 ms 4224 KB Output is correct
8 Correct 3 ms 4224 KB Output is correct
9 Correct 22 ms 5244 KB Output is correct
10 Correct 18 ms 5244 KB Output is correct
11 Correct 9 ms 4864 KB Output is correct
12 Correct 10 ms 4864 KB Output is correct
13 Correct 4 ms 4352 KB Output is correct
14 Runtime error 24 ms 9088 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -