oj.uz

답안 #756152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756152 2023-06-11T08:25:01 Z minhcool 곤돌라 (IOI14_gondola) C++17
55 / 100
 60 ms 10064 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
int n;
 
int valid(int N, int inputSeq[]){
	set<int> se;
	n = N;
	for(int i = 0; i < n; i++) se.insert(inputSeq[i]);
	if(se.size() < n) return 0;
	ii ind = {-1, -1};
	for(int i = 0; i < n; i++){
		if(inputSeq[i] <= n){
			ind = {i, inputSeq[i]};
			break;
		}
	}
	// no original gorillas
	if(ind.fi < 0) return 1;
	//set<int> se;
	// check if other original gorillas are compatible
	for(int i = ind.fi + 1; i < n; i++){
		ind.se++;
		if(ind.se > n) ind.se = 1;
		if(inputSeq[i] <= n && inputSeq[i] != ind.se) return 0;
	} 
	for(int i = 0; i < ind.fi; i++){
		ind.se++;
		if(ind.se > n) ind.se = 1;
		if(inputSeq[i] <= n && inputSeq[i] != ind.se) return 0;
	}
	return 1;
}
 
int need[N];
 
int replacement(int N, int gondolaSeq[], int replacementSeq[]){
	n = N;
	for(int i = 0; i < n; i++) need[i] = i+1;
	for(int i = 0; i < n; i++){
		if(gondolaSeq[i] <= n){
			int itr = gondolaSeq[i];
			for(int j = i; j < n; j++){
				need[j] = itr;
				itr++;
				if(itr > n) itr = 1;
			}
			for(int j = 0; j < i; j++){
				need[j] = itr;
				itr++;
				if(itr > n) itr = 1;
			}
			break;
		}
	}
	set<int> se;// se saves the numbers that are not in the conversation
	ii mx = {-1, -1};
	for(int i = 0; i < n; i++) mx = max(mx, {gondolaSeq[i], i});
	for(int i = n + 1; i <= mx.fi; i++) se.insert(i);
	for(int i = 0; i < n; i++) se.erase(gondolaSeq[i]);
	mx.se = need[mx.se];// the original number 
	for(auto it : se){
		// the next number replace the last number
		replacementSeq[it - n - 1] = mx.se;
		mx.se = it;
	}
	replacementSeq[mx.fi - n - 1] = mx.se;
	for(int i = 0; i < n; i++){// other numbers just need to be fixed once
		if(gondolaSeq[i] > n && gondolaSeq[i] != (mx.fi)){
			replacementSeq[gondolaSeq[i] - n - 1] = need[i];
		}
	}
	//for(int i = 0; i < mx.fi - n; i++) cout << replacementSeq[i] << " ";
	//cout << "\n";
    for(int i = 0; i < (mx.fi - n); i++) assert(replacementSeq[i] > 0);
	return mx.fi - n;
}

#define ll long long

int binpw(int base, int pw, int md){
	cout << base << " " << pw << "\n";
	if(pw <= 0) return 1;
	cout << base << " " << pw << "\n";
	ll ans = 1;
	while(pw){
//		cout << pw << "\n";
		if(pw & 1) ans = (ans * (ll)base) % md;
		base = ((ll)base * (ll)base) % md;
		pw >>= 1;
	}
	return (int)ans;
}

bool val(int N, int inputSeq[]){
	set<int> se;
	n = N;
	for(int i = 0; i < n; i++) se.insert(inputSeq[i]);
	if(se.size() < n) return 0;
	ii ind = {-1, -1};
	for(int i = 0; i < n; i++){
		if(inputSeq[i] <= n){
			ind = {i, inputSeq[i]};
			break;
		}
	}
	// no original gorillas
	if(ind.fi < 0) return 1;
	//set<int> se;
	// check if other original gorillas are compatible
	for(int i = ind.fi + 1; i < n; i++){
		ind.se++;
		if(ind.se > n) ind.se = 1;
		if(inputSeq[i] <= n && inputSeq[i] != ind.se) return 0;
	} 
	for(int i = 0; i < ind.fi; i++){
		ind.se++;
		if(ind.se > n) ind.se = 1;
		if(inputSeq[i] <= n && inputSeq[i] != ind.se) return 0;
	}
	return 1;
}
 
int countReplacement(int N, int inputSeq[]){
	int n = N;
	if(!val(n, inputSeq)) return 0;
//	cout << "OK\n";
//	return 1;
	vector<int> vv;
	for(int i = 0; i < n; i++) if(inputSeq[i] > n) vv.pb(inputSeq[i]);
//	cout << vv.size() << "\n";
	if(!vv.size()) return 1;
	sort(vv.begin(), vv.end());
	int answer = 1;
	int lst = n;
	for(int i = 0; i < vv.size(); i++){
		answer = ((ll)answer * (ll)binpw(vv.size() - i, vv[i] - lst - 1, mod + 2)) % (ll)(mod + 2);
		lst = vv[i];
//		answer = (answer * )
	}
	bool ck = 0;
	for(int i = 0; i < n; i++) ck |= (inputSeq[i] <= n);
	if(!ck) answer = ((ll)answer * (ll)n) % (mod + 2);
	return answer;
}
 
/*
void process(){
	int n;
	cin >> n;
	int arr[n], arr2[n];
	for(int i = 0; i < n; i++) cin >> arr[i];
	cout << countReplacement(n, arr) << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
*/

Compilation message

gondola.cpp:19:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:34:15: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |  if(se.size() < n) return 0;
      |               ^
gondola.cpp: In function 'bool val(int, int*)':
gondola.cpp:123:15: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  123 |  if(se.size() < n) return 0;
      |               ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:160:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |  for(int i = 0; i < vv.size(); i++){
      |                 ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 24 ms 3668 KB Output is correct
8 Correct 22 ms 3904 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 29 ms 4532 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 264 KB Output is correct
6 Correct 10 ms 2236 KB Output is correct
7 Correct 24 ms 3672 KB Output is correct
8 Correct 20 ms 3836 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 29 ms 4428 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 2004 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 32 ms 4588 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 9 ms 868 KB Output is correct
12 Correct 9 ms 980 KB Output is correct
13 Correct 33 ms 4572 KB Output is correct
14 Correct 8 ms 852 KB Output is correct
15 Correct 60 ms 10064 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -