oj.uz

Submission #919406

# Submission time Handle Problem Language Result Execution time Memory
919406 2024-01-31T17:40:23 Z nasir_bashirov ICC (CEOI16_icc) C++11
0 / 100
 230 ms 616 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

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

#define db long double
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
// #define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio\
    ios_base::sync_with_stdio(0);\
    cin.tie(0);\
    cout.tie(0)\

// #define int long long

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int par[105], n;
vi s[105];

void Union(int x, int y){
    if(s[par[x]].size() < s[par[y]].size())   swap(x, y);
    int tmp = par[y];
    par[y] = par[x];
    for(int i : s[tmp]){
        s[par[x]].push_back(i);
    }
    s[tmp].clear();
}


void run(int N){
    n = N;
    for(int i = 1; i <= n; i++){
        par[i] = i;
        s[i].push_back(i);
    }
    for(int t = 1; t < n; t++){
        vi v;
        for(int i = 1; i <= n; i++){
            if(par[i] == i) v.push_back(i);
        }
        bool f = false;
        for(int i = 0; i < (int)v.size() and !f; i++){
            for(int j = 0; j < (int)v.size(); j++){
                if(i == j)  continue;
                int a[] = {v[i]}, b[] = {v[j]};
                if(query(1, 1, a, b)){
                    setRoad(v[i], v[j]);
                    Union(v[i], v[j]);
                    f = true;
                    break;
                } 
            }
        }
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 600 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 205 ms 612 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 230 ms 612 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 198 ms 616 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 174 ms 616 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 179 ms 616 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -