| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 988197 |
2024-05-24T09:49:39 Z |
GrindMachine |
City (JOI17_city) |
C++17 |
|
326 ms |
45816 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
// #ifdef LOCAL
// #include "debug.h"
// #else
// #define debug(...) 42
// #endif
/*
refs:
https://ivaniscoding.wordpress.com/2018/08/28/communication-5-city/
*/
const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "Encoder.h"
vector<ll> adj[N];
vector<ll> tin(N), subsiz(N);
static vector<ll> sizes;
ll timer = 0;
void dfs1(ll u, ll p){
tin[u] = timer++;
subsiz[u] = 1;
trav(v,adj[u]){
if(v == p) conts;
dfs1(v,u);
subsiz[u] += subsiz[v];
}
auto it = lower_bound(all(sizes),subsiz[u]);
assert(it != sizes.end());
while(subsiz[u] < *it){
subsiz[u]++;
timer++;
}
}
void Encode(int n, int A[], int B[])
{
// for (int i = 0; i < N; ++i) {
// Code(i, 0LL);
// }
rep(i,n-1){
ll u = A[i], v = B[i];
adj[u].pb(v), adj[v].pb(u);
}
sizes.pb(1);
ld ratio = 1.08;
while(true){
ll nxt = max((ll)(sizes.back()*ratio),sizes.back()+1);
if(nxt >= (1<<20)) break;
sizes.pb(nxt);
}
sizes.pb((1<<20)-1);
dfs1(0,-1);
assert(subsiz[0] <= (1<<20));
// first 20 bits for tin
// next 8 bits for subsiz
rep(i,n){
ll ind = lower_bound(all(sizes),subsiz[i])-sizes.begin();
ll val = (tin[i]<<8)+ind;
Code(i,val);
}
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
refs:
https://ivaniscoding.wordpress.com/2018/08/28/communication-5-city/
*/
const int MOD = 1e9 + 7;
const int N = (1<<20) + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "Device.h"
static vector<ll> sizes;
void InitDevice()
{
sizes.pb(1);
ld ratio = 1.08;
while(true){
ll nxt = max((ll)(sizes.back()*ratio),sizes.back()+1);
if(nxt >= (1<<20)) break;
sizes.pb(nxt);
}
sizes.pb((1<<20)-1);
}
int Answer(long long S, long long T)
{
auto get = [&](ll x) -> pll{
ll ti = (x>>8);
ll ind = x^(ti<<8);
ll siz = sizes[ind];
ll tou = ti+siz-1;
return {ti,tou};
};
auto [tin1,tout1] = get(S);
auto [tin2,tout2] = get(T);
debug(tin1,tout1);
debug(tin2,tout2);
if(tin2 <= tin1 and tout2 >= tout1){
return 0;
}
if(tin1 <= tin2 and tout1 >= tout2){
return 1;
}
return 2;
}
Compilation message
Device.cpp: In function 'int Answer(long long int, long long int)':
Device.cpp:46:20: warning: statement has no effect [-Wunused-value]
46 | #define debug(...) 42
| ^~
Device.cpp:91:5: note: in expansion of macro 'debug'
91 | debug(tin1,tout1);
| ^~~~~
Device.cpp:46:20: warning: statement has no effect [-Wunused-value]
46 | #define debug(...) 42
| ^~
Device.cpp:92:5: note: in expansion of macro 'debug'
92 | debug(tin2,tout2);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
17964 KB |
Output is correct |
| 2 |
Correct |
6 ms |
17968 KB |
Output is correct |
| 3 |
Correct |
6 ms |
17964 KB |
Output is correct |
| 4 |
Correct |
6 ms |
17968 KB |
Output is correct |
| 5 |
Correct |
6 ms |
17964 KB |
Output is correct |
| 6 |
Correct |
6 ms |
17964 KB |
Output is correct |
| 7 |
Correct |
5 ms |
17968 KB |
Output is correct |
| 8 |
Correct |
6 ms |
17956 KB |
Output is correct |
| 9 |
Correct |
7 ms |
17952 KB |
Output is correct |
| 10 |
Correct |
6 ms |
17956 KB |
Output is correct |
| 11 |
Correct |
5 ms |
17956 KB |
Output is correct |
| 12 |
Correct |
6 ms |
17956 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
126 ms |
25620 KB |
Output is correct - L = 199424 |
| 2 |
Correct |
134 ms |
25460 KB |
Output is correct - L = 207872 |
| 3 |
Correct |
125 ms |
25516 KB |
Output is correct - L = 200960 |
| 4 |
Correct |
123 ms |
25520 KB |
Output is correct - L = 193280 |
| 5 |
Correct |
317 ms |
44224 KB |
Output is correct - L = 87890944 |
| 6 |
Correct |
321 ms |
44368 KB |
Output is correct - L = 87412736 |
| 7 |
Correct |
300 ms |
44192 KB |
Output is correct - L = 88209408 |
| 8 |
Correct |
311 ms |
45816 KB |
Output is correct - L = 119353344 |
| 9 |
Correct |
263 ms |
44632 KB |
Output is correct - L = 205183488 |
| 10 |
Correct |
259 ms |
44896 KB |
Output is correct - L = 188701440 |
| 11 |
Correct |
256 ms |
44792 KB |
Output is correct - L = 220052992 |
| 12 |
Correct |
273 ms |
44808 KB |
Output is correct - L = 188661760 |
| 13 |
Correct |
282 ms |
44632 KB |
Output is correct - L = 132088320 |
| 14 |
Correct |
297 ms |
44408 KB |
Output is correct - L = 105700352 |
| 15 |
Correct |
125 ms |
25500 KB |
Output is correct - L = 202240 |
| 16 |
Correct |
126 ms |
25496 KB |
Output is correct - L = 201728 |
| 17 |
Correct |
127 ms |
25592 KB |
Output is correct - L = 190976 |
| 18 |
Correct |
291 ms |
44024 KB |
Output is correct - L = 203753472 |
| 19 |
Correct |
299 ms |
43740 KB |
Output is correct - L = 63999744 |
| 20 |
Correct |
298 ms |
43784 KB |
Output is correct - L = 63999744 |
| 21 |
Correct |
294 ms |
44324 KB |
Output is correct - L = 203754240 |
| 22 |
Correct |
294 ms |
43648 KB |
Output is correct - L = 65546496 |
| 23 |
Correct |
326 ms |
43700 KB |
Output is correct - L = 65719296 |
| 24 |
Correct |
308 ms |
43472 KB |
Output is correct - L = 65870336 |
| 25 |
Correct |
297 ms |
43272 KB |
Output is correct - L = 66526208 |
| 26 |
Correct |
300 ms |
43400 KB |
Output is correct - L = 70197760 |
| 27 |
Correct |
301 ms |
43172 KB |
Output is correct - L = 69624832 |
