oj.uz

Submission #427164

# Submission time Handle Problem Language Result Execution time Memory
427164 2021-06-14T13:01:41 Z lyc City (JOI17_city) C++14
22 / 100
 597 ms 53528 KB 
#include "Encoder.h"

#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef pair<int,int> ii;

const int mxN = 250001;

int N;
vector<int> al[mxN];

int pre[mxN], pst[mxN], cnt;

void dfs(int u, int p) {
    pre[u] = cnt++;
    for (int& v : al[u]) if (v != p) {
        dfs(v,u);
    }
    pst[u] = cnt;
    //TRACE(u _ pre[u] _ pst[u]);
}

void Encode(int N, int A[], int B[])
{
    FOR(i,0,N-2){
        al[A[i]].push_back(B[i]);
        al[B[i]].push_back(A[i]);
    }

    dfs(0,-1);

	for (int i = 0; i < N; ++i) {
		Code(i, (ll)pre[i] | ((ll)pst[i]<<18));
	}
}

#include "Device.h"

#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef pair<int,int> ii;

const int MN = 1e6+5;
const int mod = 1e9+7;

void InitDevice()
{

}

int Answer(long long S, long long T)
{

    int a1 = S&((1<<18)-1), a2 = S>>18;
    int b1 = T&((1<<18)-1), b2 = T>>18;

    //TRACE(a1 _ a2 _ b1 _ b2);
    if (a2 <= b1 || b2 <= a1) return 2;
    if (a1 < b1 && b2 <= a2) return 1;
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6396 KB Output is correct
2 Correct 6 ms 6396 KB Output is correct
3 Correct 6 ms 6396 KB Output is correct
4 Correct 6 ms 6388 KB Output is correct
5 Correct 5 ms 6396 KB Output is correct
6 Correct 7 ms 6396 KB Output is correct
7 Correct 4 ms 6404 KB Output is correct
8 Correct 5 ms 6396 KB Output is correct
9 Correct 5 ms 6404 KB Output is correct
10 Correct 6 ms 6396 KB Output is correct
11 Correct 6 ms 6384 KB Output is correct
12 Correct 5 ms 6396 KB Output is correct

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 15092 KB Output is correct - L = 183501499
2 Correct 191 ms 14980 KB Output is correct - L = 183239354
3 Correct 198 ms 15008 KB Output is correct - L = 183501499
4 Correct 199 ms 14872 KB Output is correct - L = 183501499
5 Partially correct 515 ms 45796 KB Output is partially correct - L = 65536249999
6 Partially correct 510 ms 52652 KB Output is partially correct - L = 65536249999
7 Partially correct 531 ms 52420 KB Output is partially correct - L = 65536249999
8 Partially correct 546 ms 52300 KB Output is partially correct - L = 65536249999
9 Partially correct 424 ms 53376 KB Output is partially correct - L = 65536249999
10 Partially correct 424 ms 53380 KB Output is partially correct - L = 65536249999
11 Partially correct 405 ms 53344 KB Output is partially correct - L = 65536249999
12 Partially correct 424 ms 53528 KB Output is partially correct - L = 65536249999
13 Partially correct 510 ms 52924 KB Output is partially correct - L = 65536249999
14 Partially correct 488 ms 52608 KB Output is partially correct - L = 65536249999
15 Correct 200 ms 22064 KB Output is correct - L = 183501499
16 Correct 193 ms 22040 KB Output is correct - L = 183501499
17 Correct 202 ms 22056 KB Output is correct - L = 183501499
18 Partially correct 469 ms 52832 KB Output is partially correct - L = 65536249999
19 Partially correct 480 ms 52520 KB Output is partially correct - L = 65536249999
20 Partially correct 476 ms 52840 KB Output is partially correct - L = 65536249999
21 Partially correct 530 ms 52756 KB Output is partially correct - L = 65536249999
22 Partially correct 483 ms 52732 KB Output is partially correct - L = 65536249999
23 Partially correct 501 ms 52532 KB Output is partially correct - L = 65536249999
24 Partially correct 546 ms 52636 KB Output is partially correct - L = 65536249999
25 Partially correct 541 ms 52480 KB Output is partially correct - L = 65536249999
26 Partially correct 597 ms 52508 KB Output is partially correct - L = 65536249999
27 Partially correct 575 ms 52516 KB Output is partially correct - L = 65536249999