제출 #1207940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207940		vidux	스핑크스 (IOI24_sphinx)	C++17	10 / 100	41 ms	908 KiB

sphinx

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

#define FOR(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n, m) for (int i = n; i <= m; ++i)
#define REPR(i, n, m) for (int i = n; i >= m; --i)
#define FORR(x, a) for (auto& x : a)
#define FORR2(x, y, a) for (auto& [x, y] : a)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(a) ((int)a.size())

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vb> vvb;

const int INF = 1e9;
const ll LLINF = 1e18;

#include "sphinx.h"

std::vector<int> find_colours(int n, std::vector<int> X, std::vector<int> Y) {
	vi ans(n);
	FOR(i, n) {
		FOR(j, n) {
			vi e(n, j);
			e[i] = -1;
			int cnt = perform_experiment(e);
			if (cnt == 1) {
				ans[i] = j;
				break;
			}
		}
	}
	return ans;
}

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