| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 345916 |
2021-01-08T13:24:45 Z |
ACmachine |
ICC (CEOI16_icc) |
C++17 |
|
3 ms |
492 KB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
void run(int N){
vector<set<int>> trees;
REP(i, N) trees.pb({i+1});
int qa[1000];
int qb[1000];
REP(e, N-1){
int sza = 0;
int szb = 0;
bool fn = false;
REP(bit, 7){
if(fn) break;
sza = szb = 0;
vi p1;
vi p2;
REP(i, trees.size()){
for(int x : trees[i]){
if(i & (1 << bit)){
qa[sza++] = x;
p1.pb(x);
}
else{
qb[szb++] = x;
p2.pb(x);
}
}
}
if(query(sza, szb, qa, qb)){
// binary search
fn = true;
array<int, 2> ans;
int l = 0;
int r = (int)p1.size() -1;
sza = 0;
while(l != r){
int mid = (l + r) >> 1;
FOR(j, l, mid+1, 1){
qa[sza++] = p1[j];
}
if(query(sza, szb, qa, qb)){
r = mid;
}
else{
l = mid + 1;
}
}
ans[0] = p1[l];
sza = 0;
REP(j, p1.size()){
qa[sza++] = p1[j];
}
l = 0;
r = (int)p2.size() - 1;
while(l != r){
int mid = (l + r) >> 1;
FOR(j, l, mid + 1, 1){
qb[szb++] = p2[j];
}
if(query(sza, szb, qa, qb)){
r = mid;
}
else{
l = mid + 1;
}
}
ans[1] = p2[l];
setRoad(ans[0], ans[1]);
int id1 = 0;
int id2 = 0;
REP(j, trees.size()){
if(trees[j].find(ans[0]) != trees[j].end()){
id1 = j;
}
if(trees[j].find(ans[1]) != trees[j].end()){
id2 = j;
}
}
for(auto x : trees[id2])
trees[id1].insert(x);
trees.erase(trees.begin() + id2);
}
}
}
}
Compilation message
icc.cpp: In function 'void run(int)':
icc.cpp:27:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
icc.cpp:29:18: note: in expansion of macro 'FOR'
29 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
icc.cpp:100:13: note: in expansion of macro 'REP'
100 | REP(i, trees.size()){
| ^~~
icc.cpp:27:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
icc.cpp:29:18: note: in expansion of macro 'FOR'
29 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
icc.cpp:133:17: note: in expansion of macro 'REP'
133 | REP(j, p1.size()){
| ^~~
icc.cpp:27:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
icc.cpp:29:18: note: in expansion of macro 'FOR'
29 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
icc.cpp:154:17: note: in expansion of macro 'REP'
154 | REP(j, trees.size()){
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
492 KB |
Wrong road! |
| 2 |
Halted |
0 ms |
0 KB |
- |
