oj.uz

답안 #921703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921703 2024-02-04T09:14:58 Z Nika533 곤돌라 (IOI14_gondola) C++17
100 / 100
 42 ms 6492 KB 
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "gondola.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000009
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;

long long power(long long x, int y) {
	long long ans=1;
	while (y) {
		if (y%2==1) ans*=x;
		y/=2; x*=x; x%=MOD; ans%=MOD;
	}
	return ans;
}

int valid(int n, int inputSeq[])
{
	int ind=-1;
	map<int,int> mymap;
	for (int i=0; i<n; i++) {
		mymap[inputSeq[i]]++;
		if (inputSeq[i]<=n) ind=i;
	}
	for (auto x:mymap) {
		if (x.s>1) return 0;
	}
	if (ind==-1) return 1;
	for (int i=ind+1; i<n+ind; i++) {
		int num=inputSeq[((i-1)%n)]+1;
		if (num==n+1) num=1;
		if (inputSeq[(i%n)]>n) {
			inputSeq[(i%n)]=num;
		}
		else {
			if (inputSeq[(i%n)]!=num) return 0;
		}
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int mx=0;
	vector<pii> v;
	int j=0,diff=0;
	for (int i=0; i<n; i++) {
		if (gondolaSeq[i]<=n) {
			diff=(i+n-gondolaSeq[i])%n;
		}
	}
	for (int i=0; i<n; i++) {
		int val;
		if (diff>=i) val=diff-i;
		else val=diff+n-i;
		val=n-val;
		if (gondolaSeq[i]>n) v.pb({gondolaSeq[i],val});
	}
	int ind=0,cur=n+1;
	sort(all(v));
	for (int j=0; j<v.size(); j++) {
		replacementSeq[ind]=v[j].s; ind++;
		for (int o=cur; o<v[j].f; o++) {
			replacementSeq[ind]=o; ind++;
		}
		cur=v[j].f+1;
	} 
	return ind;
}

int countReplacement(int n, int inputSeq[])
{
	int arr[n];
	for (int i=0; i<n; i++) arr[i]=inputSeq[i];
  if (!valid(n,arr)) return 0;
  int mx=0,mn=1e9;
	vector<int> v;
  for (int i=0; i<n; i++) {
  		mx=max(mx,inputSeq[i]);
  		mn=min(mn,inputSeq[i]);
		if (inputSeq[i]>n) {
			v.pb(inputSeq[i]);
		}
  }
  long long ans=1;
  if (mn>n) {
  	ans=n;
  }
  int cur=n,val=v.size();
  sort(all(v));
  for (int j=0; j<v.size(); j++) {
  		int p=v[j]-cur-1;
  		ans*=power(val,p);
  		ans%=MOD;
  		cur=v[j]; val--;
  }
  int ans2=ans;
  return ans2;
}

Compilation message

gondola.cpp:2:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    2 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:68:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  for (int j=0; j<v.size(); j++) {
      |                ~^~~~~~~~~
gondola.cpp:51:6: warning: unused variable 'mx' [-Wunused-variable]
   51 |  int mx=0;
      |      ^~
gondola.cpp:53:6: warning: unused variable 'j' [-Wunused-variable]
   53 |  int j=0,diff=0;
      |      ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:98:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   for (int j=0; j<v.size(); j++) {
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2532 KB Output is correct
7 Correct 21 ms 4244 KB Output is correct
8 Correct 19 ms 4692 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 28 ms 5128 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 2396 KB Output is correct
7 Correct 26 ms 4188 KB Output is correct
8 Correct 16 ms 4444 KB Output is correct
9 Correct 5 ms 1624 KB Output is correct
10 Correct 18 ms 4956 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 12 ms 2396 KB Output is correct
14 Correct 0 ms 448 KB Output is correct
15 Correct 30 ms 5368 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 9 ms 1132 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 14 ms 1516 KB Output is correct
14 Correct 10 ms 1116 KB Output is correct
15 Correct 16 ms 2504 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 40 ms 4924 KB Output is correct
10 Correct 24 ms 4120 KB Output is correct
11 Correct 13 ms 1628 KB Output is correct
12 Correct 12 ms 1880 KB Output is correct
13 Correct 2 ms 604 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 30 ms 4736 KB Output is correct
10 Correct 23 ms 3932 KB Output is correct
11 Correct 9 ms 1628 KB Output is correct
12 Correct 11 ms 1880 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 39 ms 5560 KB Output is correct
15 Correct 42 ms 6492 KB Output is correct
16 Correct 7 ms 1372 KB Output is correct
17 Correct 27 ms 4444 KB Output is correct
18 Correct 17 ms 2648 KB Output is correct