oj.uz

답안 #707204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707204 2023-03-08T15:16:50 Z Tuanlinh123 CEOI16_icc (CEOI16_icc) C++17
90 / 100
 124 ms 588 KB 
#include<bits/stdc++.h>
#include "icc.h"
#define ll int
#define ld long double
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

ll a[105], pa[105], Rank[105];

ll Find(ll i)
{
    if (pa[i]!=i)
        pa[i]=Find(pa[i]);
    return pa[i];
}

void Union(ll a, ll b)
{
    ll Pa=Find(a), Pb=Find(b);
    if (Pa==Pb) return;
    if (Rank[Pa]<Rank[Pb]) swap(Pa, Pb);
    if (Rank[Pa]==Rank[Pb]) Rank[Pa]++;
    pa[Pb]=Pa;
}

ll ask(vector <ll> a, vector <ll> b)
{
    ll n=a.size(), m=b.size();
    ll A[n], B[m];
    for (ll i=0; i<a.size(); i++)
        A[i]=a[i];
    for (ll i=0; i<b.size(); i++)
        B[i]=b[i];
    return query(n, m, A, B);
}

ll random(ll l, ll r)
{
    return l+rand()%(r-l+1);
}

void run(ll n)
{
    srand(102745);
    for (ll i=1; i<=n; i++)
        pa[i]=i, a[i-1]=i;
    for (ll i=1; i<=n*n; i++)
    {
        ll l=random(0, n-1), r=random(0, n-1);
        swap(a[l], a[r]);
    }
    ll lg=32-__builtin_clz(n);
    for (ll k=1; k<n; k++)
    {
        for (ll i=0; i<lg; i++)
        {
            vector <ll> A, B;
            for (ll j=0; j<n; j++)
            {
                ll Pj=Find(a[j]);
                if (Pj&1<<i)
                    A.pb(a[j]);
                else B.pb(a[j]);
            }
            if (!ask(A, B))
                continue;
            ll loA=0, hiA=A.size()-1;
            while (hiA>loA)
            {
                ll midA=(hiA+loA)/2;
                vector <ll> Anew(A.begin()+loA, A.begin()+midA+1);
                if (ask(Anew, B))
                    hiA=midA;
                else loA=midA+1;
            }
            ll loB=0, hiB=B.size()-1;
            while (hiB>loB)
            {
                ll midB=(hiB+loB)/2;
                vector <ll> Bnew(B.begin()+loB, B.begin()+midB+1);
                if (ask(A, Bnew))
                    hiB=midB;
                else loB=midB+1;
            }
            setRoad(A[loA], B[loB]);
            Union(A[loA], B[loB]);
            break;
        }
    }
}

Compilation message

icc.cpp: In function 'int ask(std::vector<int>, std::vector<int>)':
icc.cpp:35:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (ll i=0; i<a.size(); i++)
      |                  ~^~~~~~~~~
icc.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (ll i=0; i<b.size(); i++)
      |                  ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Ok! 106 queries used.
2 Correct 5 ms 468 KB Ok! 105 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 504 KB Ok! 543 queries used.
2 Correct 33 ms 468 KB Ok! 676 queries used.
3 Correct 32 ms 468 KB Ok! 668 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 468 KB Ok! 1309 queries used.
2 Correct 124 ms 492 KB Ok! 1662 queries used.
3 Correct 85 ms 492 KB Ok! 1311 queries used.
4 Correct 92 ms 496 KB Ok! 1462 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 480 KB Ok! 1384 queries used.
2 Correct 95 ms 492 KB Ok! 1423 queries used.
3 Correct 101 ms 496 KB Ok! 1609 queries used.
4 Correct 85 ms 588 KB Ok! 1290 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 488 KB Ok! 1580 queries used.
2 Correct 108 ms 484 KB Ok! 1612 queries used.
3 Correct 102 ms 468 KB Ok! 1615 queries used.
4 Correct 101 ms 488 KB Ok! 1571 queries used.
5 Correct 89 ms 492 KB Ok! 1432 queries used.
6 Correct 105 ms 468 KB Ok! 1549 queries used.

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 496 KB Ok! 1601 queries used.
2 Incorrect 107 ms 492 KB Too many queries! 1659 out of 1625
3 Halted 0 ms 0 KB -