oj.uz

Submission #919419

# Submission time Handle Problem Language Result Execution time Memory
919419 2024-01-31T17:55:03 Z nasir_bashirov ICC (CEOI16_icc) C++11
0 / 100
 234 ms 848 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 n, par[105];
vi v[105];

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

void run(int N){
    n = N;
    for(int i = 1; i <= n; i++){
        v[i].push_back(i);
    }
    for(int t = 1; t < n; t++){
        bool f = false;
        for(int i = 1; i <= n and !f; i++){
            vector<bool> used(n + 5, false);
            for(int j : v[i]){
                used[j] = true;
            }
            for(int j = 1; j <= n; j++){
                if(used[j]) continue;
                int a[] = {i}, b[] = {j};
                if(query(1, 1, a, b)){
                    f = true;
                    setRoad(i, j);
                    Union(i, j);
                }
            }
        }
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 620 KB Ok! 1470 queries used.
2 Incorrect 28 ms 612 KB Wrong road!
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 234 ms 600 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 213 ms 600 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 193 ms 612 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 180 ms 612 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -