| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1074816 |
2024-08-25T14:26:07 Z |
Thanhs |
ICC (CEOI16_icc) |
C++14 |
|
1 ms |
348 KB |
#include "icc.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
// #define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define fi first
#define se second
#define all(x) x.begin(), x.end()
mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 105;
// void setRoad(int x, int y) {}
// int query(int n, int m, int a[], int b[])
// {
// for (int i = 0; i < n; i++)
// cout << a[i] << ' ';
// cout << endl;
// for (int i = 0; i < m; i++)
// cout << b[i] << ' ';
// cout << endl;
// return 1;
// }
int query(vector<int>& a, vector<int>& b)
{
int A[a.size()], B[b.size()];
for (int i = 0; i < a.size(); i++)
A[i] = a[i];
for (int i = 0; i < b.size(); i++)
B[i] = b[i];
return query((int)a.size(), (int)b.size(), A, B);
}
int BS(vector<int> a, vector<int>& b)
{
vector<int> bs = a;
int l = 0, r = bs.size();
while (l < r - 1)
{
a.clear();
int m = l + r >> 1;
for (int i = 1; i <= m; i++)
a.push_back(bs[i - 1]);
if (query(a, b))
r = m;
else
l = m;
}
return bs[r - 1];
}
int rs[NM], id[NM];
vector<int> v[NM];
set<int> s, did;
vector<int> a, b;
void merge(int x, int y)
{
if (v[x].size() < v[y].size())
swap(x, y);
s.erase(y);
for (int t : v[y])
v[x].push_back(t);
}
void run(int N)
{
for (int i = 1; i <= N; i++)
{
v[i].push_back(i);
s.insert(i);
}
for (int n = N; n >= 2; n--)
{
iota(rs + 1, rs + 1 + n, 1);
random_shuffle(rs + 1, rs + 1 + n);
auto it = s.begin();
for (int i = 1; i <= n; i++, it = next(it))
id[i] = *it;
int mid = -1;
did.clear();
while (1)
{
mid = rand(1, n - 1);
if (did.find(mid) != did.end())
continue;
did.insert(mid);
a.clear(); b.clear();
for (int i = 1; i <= n; i++)
for (auto t : v[id[rs[i]]])
{
if (i <= mid)
a.push_back(t);
else
b.push_back(t);
}
return;
if (query(a, b))
break;
}
int x = BS(a, b), y = BS(b, a);
setRoad(x, y);
merge(x, y);
}
}
// int main()
// {
// run(4);
// }
Compilation message
icc.cpp: In function 'int query(std::vector<int>&, std::vector<int>&)':
icc.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
40 | for (int i = 0; i < a.size(); i++)
| ~~^~~~~~~~~~
icc.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for (int i = 0; i < b.size(); i++)
| ~~^~~~~~~~~~
icc.cpp: In function 'int BS(std::vector<int>, std::vector<int>&)':
icc.cpp:54:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
54 | int m = l + r >> 1;
| ~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Not all edges were guessed! |
| 2 |
Halted |
0 ms |
0 KB |
- |
