Submission #1209879

#TimeUsernameProblemLanguageResultExecution timeMemory
1209879andrej246Sphinx's Riddle (IOI24_sphinx)C++20
0 / 100
1 ms412 KiB
#include "sphinx.h"

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

#define NL "\n"
#define EL cout << NL
#define FOR(i,n) for (long long i = 0; i < (n); i++)
#define FORS(i,s,n) for (long long i = (s); i < (n); i++)
#define FORR(i,n) for (long long i = (n)-1; i >= 0; i--)
#define PRINTV(v) for (auto a: v) {cout << a << " ";} EL;
#define PRINTVV(v) for (auto a: v) {PRINTV(a);}
#define f first
#define s second
#define all(v) (v).begin(),(v).end()

typedef vector<int> vi;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;

std::vector<int> find_colours(int n, std::vector<int> x, std::vector<int> y) {

    vector<int> ans(n);

    ll cur = 0;
    ll prev = n;
    FOR(u,n) {
        vi e(n,-1);
        FOR(i,u+1) e[i] = n;
        ll res = perform_experiment(e);

        ans[u] = cur;
        if (res < prev) cur++;

        prev = res;
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...