oj.uz

답안 #963641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963641 2024-04-15T12:15:18 Z LucaIlie CEOI16_icc (CEOI16_icc) C++17
61 / 100
 139 ms 848 KB 
#include "icc.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100;
int leader[MAX_N + 1];
vector<int> group[MAX_N + 1];

bool qry( vector<int> a, vector<int> b ) {
    int aa[a.size()], bb[b.size()];
    for ( int i = 0; i < a.size(); i++ )
        aa[i] = a[i];
    for ( int i = 0; i < b.size(); i++ )
        bb[i] = b[i];
    return query( a.size(), b.size(), aa, bb );
}

pair<int, int> solve( vector<int> a, vector<int> b ) {
    if ( b.size() == 1 ) {
        if ( a.size() == 1 )
            return { a[0], b[0] };

        vector<int> a1, a2;
        for ( int i = 0; i < a.size() / 2; i++ )
            a1.push_back( a[i] );
        for ( int i = a.size() / 2; i < a.size(); i++ )
            a2.push_back( a[i] );

        if ( qry( a1, b ) )
            return solve( a1, b );
        return solve( a2, b );
    }

    vector<int> b1, b2;
    for ( int i = 0; i < b.size() / 2; i++ )
        b1.push_back( b[i] );
    for ( int i = b.size() / 2; i < b.size(); i++ )
        b2.push_back( b[i] );

    if ( qry( a, b1 ) )
        return solve( a, b1 );
    return solve( a, b2 );
}

void run( int n ) {
    for ( int v = 1; v <= n; v++ ) {
        leader[v] = v;
        group[v].push_back( v );
    }
    for ( int i = 0; i < n - 1; i++ ) {
        vector<vector<int>> g;
        for ( int v = 1; v <= n; v++ ) {
            if ( leader[v] == v )
                g.push_back( group[v] );
        }

        while ( 1 ) {
            random_shuffle( g.begin(), g.end() );

            vector<int> a, b;
            for ( int i = 0; i < g.size() / 2; i++ ) {
                for ( int v: g[i] )
                    a.push_back( v );
            }
            for ( int i = g.size() / 2; i < g.size(); i++ ) {
                for ( int v: g[i] )
                    b.push_back( v );
            }

            /*for ( int i = 0; i < a.size(); i++ )
                cout << a[i] << " ";
            cout << "\n";
            for ( int i = 0; i < b.size(); i++ )
                cout << b[i] << " ";
            cout << "\n";
            cout << "\n";*/

            if ( qry( a, b ) ) {
                auto e = solve( a, b );
                setRoad( e.first, e.second );
                int x = leader[e.first], y = leader[e.second];
                for ( int v: group[y] ) {
                    leader[v] = x;
                    group[x].push_back( v );
                }
                group[y].clear();
                break;
            }
        }
    }
}

Compilation message

icc.cpp: In function 'bool qry(std::vector<int>, std::vector<int>)':
icc.cpp:12:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for ( int i = 0; i < a.size(); i++ )
      |                      ~~^~~~~~~~~~
icc.cpp:14:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for ( int i = 0; i < b.size(); i++ )
      |                      ~~^~~~~~~~~~
icc.cpp: In function 'std::pair<int, int> solve(std::vector<int>, std::vector<int>)':
icc.cpp:25:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for ( int i = 0; i < a.size() / 2; i++ )
      |                          ~~^~~~~~~~~~~~~~
icc.cpp:27:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for ( int i = a.size() / 2; i < a.size(); i++ )
      |                                     ~~^~~~~~~~~~
icc.cpp:36:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for ( int i = 0; i < b.size() / 2; i++ )
      |                      ~~^~~~~~~~~~~~~~
icc.cpp:38:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for ( int i = b.size() / 2; i < b.size(); i++ )
      |                                 ~~^~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:62:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for ( int i = 0; i < g.size() / 2; i++ ) {
      |                              ~~^~~~~~~~~~~~~~
icc.cpp:66:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |             for ( int i = g.size() / 2; i < g.size(); i++ ) {
      |                                         ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 604 KB Ok! 107 queries used.
2 Correct 4 ms 604 KB Ok! 96 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 620 KB Ok! 548 queries used.
2 Correct 41 ms 604 KB Ok! 842 queries used.
3 Correct 38 ms 604 KB Ok! 803 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 640 KB Ok! 1499 queries used.
2 Correct 139 ms 628 KB Ok! 2117 queries used.
3 Correct 104 ms 604 KB Ok! 1736 queries used.
4 Correct 101 ms 600 KB Ok! 1699 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 848 KB Ok! 1589 queries used.
2 Correct 102 ms 604 KB Ok! 1628 queries used.
3 Correct 106 ms 656 KB Ok! 1760 queries used.
4 Correct 91 ms 600 KB Ok! 1524 queries used.

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 122 ms 632 KB Too many queries! 1936 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 636 KB Too many queries! 1876 out of 1625
2 Halted 0 ms 0 KB -