Submission #869782

#	Time	Username	Problem	Language	Result	Execution time	Memory
869782		Ariadna	ICC (CEOI16_icc)	C++14	7 / 100	229 ms	620 KiB

icc

#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

vector < int > p;

int root(int a) {
    if (p[a] == a) return a;
    return p[a] = root(p[a]);
}

void join(int a, int b) {
    p[root(a)] = root(b);
}

void run(int N) {
    p = vector < int >(N);
    for (int i = 0; i < N; ++i) {
        p[i] = i;
    }
    for (int t = 1; t < N; ++t) {
        bool founded = false;
        for (int i = 0; i < N && !founded; ++i) {
            for (int j = i + 1; j < N && !founded; ++j) {
                if (root(i) == root(j)) continue;
                int a[1] = {i + 1};
                int b[1] = {j + 1};
                if (query(1, 1, a, b)) {
                    setRoad(i + 1, j + 1);
                    join(i, j);
                    founded = true;
                }
            }
        }
    }
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10