oj.uz

Submission #1117044

# Submission time Handle Problem Language Result Execution time Memory
1117044 2024-11-22T19:19:45 Z gustavo_d ICC (CEOI16_icc) C++17
0 / 100
 220 ms 840 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100;
vector<int> adj[MAXN+1];
bool vis[MAXN+1];

void dfs(int v) {
    vis[v] = true;
    for (int viz : adj[v]) {
        if (!vis[viz]) dfs(viz);
    }
}
// TODO: estudar flag pra debugar interativo
// void setRoad(int a, int b) {
//     cout << "report" << a << ' ' << b << endl;
// };

int do_query(vector<int> a, vector<int> b) {
    int tmp[MAXN], tmp2[MAXN];
    for (int i=0; i<(int)a.size(); i++) tmp[i] = a[i];
    for (int i=0; i<(int)b.size(); i++) tmp2[i] = b[i];
    // for (int i : a) cout << i << ' ';
    // cout << endl;
    // for (int i : b) cout << i << ' ';
    // cout << endl;
    // int v; cin >> v;
    // return v;
    return query((int)a.size(), (int)b.size(), tmp, tmp2);
}

void run(int N) {
    srand(time(0));
    int n = N;
    for (int e=0; e<n-1; e++) {
        bool found = false;
        for (int a=1; a<=n and !found; a++) {
            for (int b=a+1; b<=n and !found; b++) {
                if (do_query(vector<int> (1, a), vector<int> (1, b))) {
                    setRoad(a, b);
                    found = true;
                }
            }
        }
        vector<int> src(n);
        for (int i=0; i<n; i++) src[i] = i+1;
        random_shuffle(src.begin(), src.end());
        int a = 0; vector<int> dest;
        for (int v : src) {
            dfs(v);
            for (int i=1; i<=n; i++) {
                if (!vis[i]) dest.push_back(i);
            }
            for (int i=1; i<=n; i++) vis[i] = false;
            a = v;
            if (do_query(vector<int> (1, v), dest)) break;
            dest.clear();
        }
        random_shuffle(dest.begin(), dest.end());
        for (int b : dest) {
            if (do_query(vector<int>(1, a), vector<int> (1, b))) {
                setRoad(a, b);
                adj[a].push_back(b);
                adj[b].push_back(a);
                break;
            }
        }
    }
}

// int main() {
//     int n; cin >> n;
//     run(n);
//     return 0;
// }

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 592 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 592 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 220 ms 592 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 181 ms 592 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 181 ms 592 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 176 ms 840 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -