oj.uz

답안 #1063738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063738 2024-08-18T00:37:16 Z pawned 곤돌라 (IOI14_gondola) C++17
60 / 100
 20 ms 6444 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "gondola.h"

const ll MOD = 1e9 + 7;

ll nr(ll x) {
	x %= MOD;
	x += MOD;
	x %= MOD;
	return x;
}

ll binpow(ll x, ll y) {
	x = nr(x);
	ll res = 1;
	while (y > 0) {
		if (y % 2 == 1)
			res = nr(res * x);
		x = nr(x * x);
		y /= 2;
	}
	return res;
}

int valid(int N, int inputSeq[]) {
	vi a;
	for (int i = 0; i < N; i++) {
		a.pb(inputSeq[i] - 1);
	}
	int fpos = -1;	// fixed position
	int fval = -1;	// fixed val at position
	for (int i = 0; i < N; i++) {
		if (a[i] < N) {
			fpos = i;
			fval = a[i];
		}
	}
	vi b;
	if (fval > fpos) {
		int s = fval - fpos;
		for (int i = N - s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < N - s; i++) {
			b.pb(a[i]);
		}
	}
	else {
		int s = fpos - fval;
		for (int i = s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < s; i++) {
			b.pb(a[i]);
		}
	}
	for (int i = 0; i < N; i++) {
		if (b[i] < N) {
			if (b[i] != i)
				return 0;
		}
	}
	// all values must be diff
	set<int> allv;
	for (int x : b)
		allv.insert(x);
	if (allv.size() != N)
		return 0;
	return 1;
}

int replacement(int N, int gondolaSeq[], int replacementSeq[]) {
	vi a;
	for (int i = 0; i < N; i++) {
		a.pb(gondolaSeq[i] - 1);
	}
	int fpos = -1;	// fixed position
	int fval = -1;	// fixed val at position
	for (int i = 0; i < N; i++) {
		if (a[i] < N) {
			fpos = i;
			fval = a[i];
		}
	}
	vi b;
	if (fpos == -1) {
		b = a;
	}
	else if (fval > fpos) {
		int s = fval - fpos;
		for (int i = N - s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < N - s; i++) {
			b.pb(a[i]);
		}
	}
	else {
		int s = fpos - fval;
		for (int i = s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < s; i++) {
			b.pb(a[i]);
		}
	}
/*	cout<<"b: ";
	for (int x : b)
		cout<<x<<" ";
	cout<<endl;*/
	// replace 0, 1, ..., N - 1 with b
	vector<ii> rep;
	for (int i = 0; i < N; i++) {
		if (b[i] != i)
			rep.pb({b[i], i});
	}
	sort(rep.begin(), rep.end());
/*	cout<<"rep: ";
	for (ii p : rep)
		cout<<"("<<p.fi<<", "<<p.se<<"); ";
	cout<<endl;*/
	if (rep.size() == 0) {	// just 0 to N - 1
		return 0;
	}
	int curr = N - 1;
	vi ans;
	for (int i = 0; i < rep.size(); i++) {
		ans.pb(rep[i].se);
		for (int j = curr + 1; j < rep[i].fi; j++) {
			ans.pb(j);
		}
		curr = rep[i].fi;
	}
	int K = ans.size();
	for (int i = 0; i < K; i++) {
		replacementSeq[i] = ans[i] + 1;
	}
	return K;
}

int countReplacement(int N, int inputSeq[]) {
	if (!valid(N, inputSeq))
		return 0;
	vi a;
	for (int i = 0; i < N; i++) {
		a.pb(inputSeq[i] - 1);
	}
	vi pr;	// those over N - 1
	for (int i = 0; i < N; i++) {
		if (a[i] > N - 1)
			pr.pb(a[i]);
	}
	pr.pb(N - 1);
	sort(pr.begin(), pr.end());
/*	cout<<"pr: ";
	for (int x : pr)
		cout<<x<<" ";
	cout<<endl;*/
	int K = pr.size();
	ll ans = 1;
	for (int i = 0; i < K - 1; i++) {
		ll diff = pr[i + 1] - pr[i] - 1;
		ans = nr(ans * binpow(K - i - 1, diff));
	}
	if (K == N + 1)
		ans = nr(ans * N);
	return (int)(ans);
}

// subtasks 1, 2, 3: check validity

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:78:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |  if (allv.size() != N)
      |      ~~~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:138:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |  for (int i = 0; i < rep.size(); i++) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 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 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 3084 KB Output is correct
7 Correct 8 ms 3280 KB Output is correct
8 Correct 15 ms 5600 KB Output is correct
9 Correct 4 ms 1884 KB Output is correct
10 Correct 20 ms 6444 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 8 ms 3160 KB Output is correct
7 Correct 8 ms 3276 KB Output is correct
8 Correct 15 ms 5608 KB Output is correct
9 Correct 5 ms 2012 KB Output is correct
10 Correct 18 ms 6228 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 3 ms 1748 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 7 ms 3280 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 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 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.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
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 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 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 0 ms 448 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 596 KB Output is correct
11 Correct 7 ms 3280 KB Output is correct
12 Correct 8 ms 3536 KB Output is correct
13 Correct 10 ms 2912 KB Output is correct
14 Correct 7 ms 3280 KB Output is correct
15 Correct 19 ms 3164 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
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 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
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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