oj.uz

Submission #23379

# Submission time Handle Problem Language Result Execution time Memory
23379 2017-05-07T18:40:55 Z rubabredwan ICC (CEOI16_icc) C++14
90 / 100
 136 ms 2272 KB 
/* Bismillahir Rahmanir Rahim */

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

using namespace std;

const int N = 105;

int n, par[N], mat[N][N];
set<int>comp;
vector<int>nudes[N];

int Find(int at){
    return par[at] == at ? at : par[at] = Find(par[at]);
}

void Union(int a, int b){
    int x = Find(a);
    int y = Find(b);
    for(auto u : nudes[y]){
        nudes[x].push_back(u);
    }
    par[y] = x;
    comp.erase(y);
}

/* void setRoad(int a, int b){ */
/*     if(a) Union(a, b); */
/*     int x, y; */
/*     cin >> x >> y; */
/*     mat[x][y] = 1; */
/*     mat[y][x] = 1; */
/* } */

/* int query(int sa, int sb, int a[], int b[]){ */
/*     for(int i=0;i<sa;i++){ */
/*         for(int j=0;j<sb;j++){ */
/*             if(mat[a[i]][b[j]]) return true; */
/*         } */
/*     } */
/*     return false; */
/* } */

int fuk[N], tt;

int get(int sa, int sb, int a[], int b[]){
    int lo = 0, hi = sb - 1;
    while(lo < hi){
        int mid = (lo + hi) / 2; tt = 0;
        for(int i=lo;i<=mid;i++) fuk[tt] = b[i], ++tt;
        if(query(sa, tt, a, fuk)) hi = mid;
        else lo = mid + 1;
    }
    return b[lo];
}

int aa[N], bb[N];
int sa, sb;

void run(int _n){
    srand(time(NULL));
    n = _n;
    comp.clear();
    for(int i=1;i<=n;i++){
        par[i] = i;
        comp.insert(i);
        nudes[i].push_back(i);
    }
    int road = n - 1;
    while(road--){
        for(int bit=7;bit>=0;bit--){
            sa = 0, sb = 0;
            for(auto u : comp){
                if(u & (1 << bit)) for(auto v : nudes[u]) aa[sa] = v, ++sa;
                else for(auto v : nudes[u]) bb[sb] = v, ++sb;
            }
            if(sa == 0 || sb == 0) continue;
            /* cout << "-------\n"; */
            /* cout << sa << ' ' << sb << endl; */
            /* for(int i=0;i<sa;i++) cout << aa[i] << ' '; cout << endl; */
            /* for(int i=0;i<sb;i++) cout << bb[i] << ' '; cout << endl; */
            if(query(sa, sb, aa, bb)){
                int x = get(sa, sb, aa, bb);
                int y = get(sb, sa, bb, aa);
                Union(x, y);
                setRoad(x, y);
                break;
            }
        }
    }
}

/* int main(){ */
/*     int ff, x, y; */
/*     scanf("%d", &ff); */
/*     setRoad(0, 0); */
/*     run(ff); */
/* 	return 0; */
/* } */

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2136 KB Ok! 105 queries used.
2 Correct 3 ms 2136 KB Ok! 102 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2140 KB Ok! 539 queries used.
2 Correct 43 ms 2132 KB Ok! 667 queries used.
3 Correct 39 ms 2136 KB Ok! 667 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 2268 KB Ok! 1459 queries used.
2 Correct 129 ms 2268 KB Ok! 1633 queries used.
3 Correct 119 ms 2264 KB Ok! 1520 queries used.
4 Correct 119 ms 2264 KB Ok! 1541 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 2268 KB Ok! 1538 queries used.
2 Correct 116 ms 2264 KB Ok! 1528 queries used.
3 Correct 123 ms 2272 KB Ok! 1611 queries used.
4 Correct 116 ms 2272 KB Ok! 1492 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 2268 KB Ok! 1632 queries used.
2 Correct 126 ms 2272 KB Ok! 1625 queries used.
3 Correct 126 ms 2264 KB Ok! 1647 queries used.
4 Correct 136 ms 2264 KB Ok! 1642 queries used.
5 Correct 126 ms 2268 KB Ok! 1540 queries used.
6 Correct 126 ms 2264 KB Ok! 1622 queries used.

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 2268 KB Too many queries! 1629 out of 1625
2 Halted 0 ms 0 KB -