# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
551928 |
2022-04-21T22:35:30 Z |
Lobo |
City (JOI17_city) |
C++17 |
|
445 ms |
44772 KB |
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 3e5+10;
int tin[maxn], tout[maxn], timer;
vector<int> g[maxn];
void dfs(int u, int ant) {
tin[u] = ++timer;
for(auto v : g[u]) if(v != ant) {
dfs(v,u);
}
tout[u] = timer;
}
void Encode(int32_t N, int32_t A[], int32_t B[]) {
for(int i = 0; i < N-1; i++) {
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
}
dfs(0,0);
for(int i = 0; i < N; i++) {
// cout << i << " " << 1000000*tin[i]+tout[i] << endl;
Code(i,1000000*tin[i]+tout[i]);
}
}
// int32_t main() {
// ios::sync_with_stdio(false); cin.tie(0);
// freopen("in.in", "r", stdin);
// // freopen("out.out", "w", stdout);
// int32_t n; cin >> n;
// int32_t a[n-1],b[n-1];
// for(int i = 0; i < n-1; i++) {
// cin >> a[i] >> b[i];
// }
// Encode(n,a,b);
// }
#include "Device.h"
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = -1;
void InitDevice() {}
int32_t Answer(int S, int T) {
int in1 = S/(1000000);
int out1 = S-in1*1000000;
int in2 = T/(1000000);
int out2 = T-in2*1000000;
if(in1 <= in2 && out1 >= out2) {
return 1;
}
else if(in2 <= in1 && out2 >= out1) {
return 0;
}
else {
return 2;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7708 KB |
Output is correct |
2 |
Correct |
4 ms |
7708 KB |
Output is correct |
3 |
Correct |
4 ms |
7708 KB |
Output is correct |
4 |
Correct |
4 ms |
7708 KB |
Output is correct |
5 |
Correct |
5 ms |
7708 KB |
Output is correct |
6 |
Correct |
4 ms |
7704 KB |
Output is correct |
7 |
Correct |
4 ms |
7716 KB |
Output is correct |
8 |
Correct |
4 ms |
7708 KB |
Output is correct |
9 |
Correct |
3 ms |
7708 KB |
Output is correct |
10 |
Correct |
4 ms |
7708 KB |
Output is correct |
11 |
Correct |
3 ms |
7708 KB |
Output is correct |
12 |
Correct |
4 ms |
7708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
152 ms |
16176 KB |
Output is partially correct - L = 700000700 |
2 |
Partially correct |
155 ms |
16200 KB |
Output is partially correct - L = 699000699 |
3 |
Partially correct |
150 ms |
16384 KB |
Output is partially correct - L = 700000700 |
4 |
Partially correct |
203 ms |
16272 KB |
Output is partially correct - L = 700000700 |
5 |
Partially correct |
445 ms |
43512 KB |
Output is partially correct - L = 250000250000 |
6 |
Partially correct |
407 ms |
43524 KB |
Output is partially correct - L = 250000250000 |
7 |
Partially correct |
400 ms |
43444 KB |
Output is partially correct - L = 250000250000 |
8 |
Partially correct |
440 ms |
44772 KB |
Output is partially correct - L = 250000250000 |
9 |
Partially correct |
350 ms |
43960 KB |
Output is partially correct - L = 250000250000 |
10 |
Partially correct |
358 ms |
43904 KB |
Output is partially correct - L = 250000250000 |
11 |
Partially correct |
378 ms |
44096 KB |
Output is partially correct - L = 250000250000 |
12 |
Partially correct |
359 ms |
43896 KB |
Output is partially correct - L = 250000250000 |
13 |
Partially correct |
399 ms |
43668 KB |
Output is partially correct - L = 250000250000 |
14 |
Partially correct |
386 ms |
43516 KB |
Output is partially correct - L = 250000250000 |
15 |
Partially correct |
153 ms |
16408 KB |
Output is partially correct - L = 700000700 |
16 |
Partially correct |
154 ms |
16236 KB |
Output is partially correct - L = 700000700 |
17 |
Partially correct |
162 ms |
16356 KB |
Output is partially correct - L = 700000700 |
18 |
Partially correct |
355 ms |
43032 KB |
Output is partially correct - L = 250000250000 |
19 |
Partially correct |
351 ms |
43084 KB |
Output is partially correct - L = 250000250000 |
20 |
Partially correct |
350 ms |
42876 KB |
Output is partially correct - L = 250000250000 |
21 |
Partially correct |
355 ms |
43524 KB |
Output is partially correct - L = 250000250000 |
22 |
Partially correct |
377 ms |
42804 KB |
Output is partially correct - L = 250000250000 |
23 |
Partially correct |
356 ms |
42676 KB |
Output is partially correct - L = 250000250000 |
24 |
Partially correct |
373 ms |
42572 KB |
Output is partially correct - L = 250000250000 |
25 |
Partially correct |
368 ms |
42504 KB |
Output is partially correct - L = 250000250000 |
26 |
Partially correct |
396 ms |
42632 KB |
Output is partially correct - L = 250000250000 |
27 |
Partially correct |
388 ms |
42400 KB |
Output is partially correct - L = 250000250000 |