oj.uz

Submission #912392

# Submission time Handle Problem Language Result Execution time Memory
912392 2024-01-19T11:29:52 Z oblantis Gondola (IOI14_gondola) C++17
50 / 100
 17 ms 2444 KB 
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxn = 1e5 + 1;
#include "gondola.h"

int valid(int n, int a[]){
	for(int i = 0; i < n; i++){
		if(a[i] <= n){
			int j = (i + 1) % n, o = a[i] % n + 1;
			while(j != i){
				if(a[j] <= n && a[j] != o)return 0;
				j = (j + 1) % n;
				o = o % n + 1;
			}
			return 1;
		}
	}
	return 1;
}
int replacement(int n, int a[], int out[]){
	pii b[n];
	for(int i = 0; i < n; i++){
		if(a[i] <= n){
			int x = a[i] % n + 1, j = (i + 1) % n, o = 1;
			while(j != i){
				b[o] = {a[j], x};
				x = x % n + 1;
				j = (j + 1) % n;
				o++;
			}
			break;
		}
		else if(i == n - 1){
			for(int j = 0; j < n; j++)b[j] = {a[j], j + 1};
		}
	}
	sort(b, b + n);
	int x = b[n - 1].ff - n;
	for(int i = n + 1, j = 0, o = 0; j < n; j++){
		if(b[j].ff == b[j].ss)continue;
		while(b[j].ff != b[j].ss){
			out[o++] = b[j].ss;
			b[j].ss = i;
			i++;
		}
	}
	
	return x;
}
int countReplacement(int n, int a[]){
	if(!valid(n, a)){
		return 0;
	}
	return 1;
}

//void solve() {
	//int n;
	//cin >> n;
	//int a[n];
	//for(int i = 0; i < n; i++){
		//cin >> a[i];
	//}
	//int out[1000];
	//int sz = replacement(n, a, out);
	//cout << sz << ' ';
	//for(int j = 0; j < sz; j++)cout << out[j] << ' ';
//}

//int main() {
	//ios_base::sync_with_stdio(0);
	//cin.tie(0);
	//int times = 1;
	////cin >> times;
	//for(int i = 1; i <= times; i++) {
		//solve();
	//}
	//return 0;
//}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 4 ms 604 KB Output is correct
7 Correct 8 ms 1116 KB Output is correct
8 Correct 8 ms 1368 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 9 ms 1116 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 5 ms 604 KB Output is correct
7 Correct 9 ms 1116 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 9 ms 1116 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 344 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 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 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 1624 KB Output is correct
12 Correct 13 ms 1880 KB Output is correct
13 Correct 12 ms 1568 KB Output is correct
14 Correct 9 ms 1628 KB Output is correct
15 Correct 17 ms 2444 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 756 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory 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 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -