| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 988143 |
2024-05-24T06:29:12 Z |
GrindMachine |
City (JOI17_city) |
C++17 |
|
3000 ms |
43968 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
/*
*/
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), tout(N);
ll timer = 0;
void dfs1(ll u, ll p){
tin[u] = timer++;
trav(v,adj[u]){
if(v == p) conts;
dfs1(v,u);
}
tout[u] = timer-1;
}
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);
}
dfs1(0,-1);
ll mul = 250000;
rep(i,n){
ll val = mul*tin[i]-tin[i]*(tin[i]-1)/2;
val += tout[i]-tin[i];
// cout << tin[i] << " " << tout[i] << endl;
// cout << val << endl;
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
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "Device.h"
void InitDevice()
{
}
int Answer(long long S, long long T)
{
ll mul = 250000;
auto get = [&](ll x) -> pll{
x++;
ll sum = 0;
rep(ti,mul){
sum += mul-ti;
if(sum >= x){
sum -= mul-ti;
ll tou = ti+x-sum-1;
return {ti,tou};
}
}
assert(0);
return {-1,-1};
};
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:90:5: note: in expansion of macro 'debug'
90 | debug(tin1,tout1);
| ^~~~~
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(tin2,tout2);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
17956 KB |
Output is correct |
| 2 |
Correct |
6 ms |
17956 KB |
Output is correct |
| 3 |
Correct |
6 ms |
17968 KB |
Output is correct |
| 4 |
Correct |
6 ms |
17956 KB |
Output is correct |
| 5 |
Correct |
6 ms |
17964 KB |
Output is correct |
| 6 |
Correct |
5 ms |
17960 KB |
Output is correct |
| 7 |
Correct |
6 ms |
17968 KB |
Output is correct |
| 8 |
Correct |
5 ms |
17956 KB |
Output is correct |
| 9 |
Correct |
6 ms |
17968 KB |
Output is correct |
| 10 |
Correct |
6 ms |
18472 KB |
Output is correct |
| 11 |
Correct |
5 ms |
17956 KB |
Output is correct |
| 12 |
Correct |
8 ms |
17936 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
236 ms |
25564 KB |
Output is correct - L = 174506049 |
| 2 |
Correct |
230 ms |
25500 KB |
Output is correct - L = 174256747 |
| 3 |
Correct |
226 ms |
25608 KB |
Output is correct - L = 174506049 |
| 4 |
Correct |
227 ms |
25504 KB |
Output is correct - L = 174506049 |
| 5 |
Execution timed out |
3034 ms |
43968 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
