Submission #1328471

#	Time	Username	Problem	Language	Result	Execution time	Memory
1328471		QuocSensei	ICC (CEOI16_icc)	C++20	0 / 100	186 ms	1088 KiB

icc

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

#define ll long long 
#define el cout << endl
#define ii pair<int, int>
#define fi first 
#define se second

using namespace std;

const int maxn = 1e2;

int do_query(vector<int> a, vector<int> b)
{
    int sz_a = a.size();
    int sz_b = b.size();
    int _a[sz_a];
    int _b[sz_b];
    for (int i = 0; i < sz_a; i++)
        _a[i] = a[i];
    for (int i = 0; i < sz_b; i++)
        _b[i] = b[i];
    return query(sz_a, sz_b, _a, _b);
}

namespace SUBTASK_1
{
    int n;
    bool check[maxn + 10][maxn + 10];

    void run(int N)
    {
        n = N;
        for (int _ = 1; _ <= n - 1; _++)
        {
            for (int i = 1; i <= n; i++)
            {
                bool flag = 0;
                for (int j = i + 1; j <= n; j++)
                {
                    if (check[i][j])
                        continue;
                    if (do_query({i}, {j}))
                    {
                        setRoad(i, j);
                        check[i][j] = 1;
                        flag = 1;
                        break;
                    }
                }
                if (flag)
                    break;
            }
        }
    }
    bool check_sub(int n)
    {
        return n == 15;
    }
};
namespace SUBTASK_2
{
    int n;
    set<int> st[maxn + 10];

    void run(int N)
    {
        n = N;
        for (int i = 1; i <= n; i++)
        {
            st[i].clear();
            for (int j = 1; j <= n; j++)
                if (i != j)
                    st[i].insert(j);
        }
        for (int _ = 1; _ < n; _++)
        {
            vector<int> x;
            for (int i = 1; i <= n; i++)
            {
                if (st[i].empty())
                    continue;
                vector<int> y;
                for (int p : st[i])
                    y.push_back(p);
                if (do_query({i}, y))
                    x.push_back(i);
                if (x.size() == 2)
                    break;
            }
            st[x[0]].erase(x[1]);
            st[x[1]].erase(x[0]);
            setRoad(x[0], x[1]);
        }
    }
};

void run(int N)
{
    SUBTASK_2::run(N);
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10