제출 #1177405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177405		Kaztaev_Alisher	스핑크스 (IOI24_sphinx)	C++20	3 / 100	0 ms	412 KiB

sphinx

#include <bits/stdc++.h>

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second

using namespace std;
using ll = long long;

const ll N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7;

int perform_experiment(vector<int> E);

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
	vector<int> E(N, -1);
	int x = perform_experiment(E);
	vector<int> G(N, 0);
	if(x == 1){
		for(int i = 0; i < N; i++){
			vector<int> E(N, -1);
			E[0] = i;
			int x = perform_experiment(E);
			if(x == 1){
				G[0] = G[1] = i;
				break;
			}
		}
	} else {
		for(int i = 0; i < N; i++){
			vector<int> E(N, -1);
			E[0] = i;
			int x = perform_experiment(E);
			if(x == 1){
				G[1] = i;
				break;
			}
		}
		for(int i = 0; i < N; i++){
			vector<int> E(N, -1);
			E[1] = i;
			int x = perform_experiment(E);
			if(x == 1){
				G[0] = i;
				break;
			}
		}
	}
	return G;
}

• Subtask 0: 0 / 0
• Subtask 1: 3 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 33
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36