oj.uz

Submission #934019

# Submission time Handle Problem Language Result Execution time Memory
934019 2024-02-26T17:07:27 Z Saul0906 City (JOI17_city) C++14
18 / 100
 280 ms 57684 KB 
#include <bits/stdc++.h>
#include "Encoder.h"
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pb push_back

using namespace std;

const int lim=3e5+5;
ll tim=0, tin[lim], tout[lim];
vector<int> ady[lim];
void dfs(int u, int p){
	tin[u]=tim;
	repa(v,ady[u]){
		if(v!=p) dfs(v,u);
	}
	tout[u]=tim++;
}

void Encode(int N, int *A, int *B){
	rep(i,0,N-1){
		ady[A[i]].pb(B[i]);
		ady[B[i]].pb(A[i]);
	}
	dfs(0,-1);
	rep(i,0,N){
		ll x=tout[i]-tin[i];
		x*=1e6;
		x+=tin[i];
		//cout<<i<<" "<<x<<" "<<tin[i]<<" "<<tout[i]<<endl;
		Code(i,x);
	}
}

#include <bits/stdc++.h>
#include "Device.h"
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long

using namespace std;

void InitDevice(){
	return;
}

const ll md=1e6;

int Answer(ll S, ll T){
	ll a, b, c, d;
	a=(S%md);
	S/=md;
	b=(S%md);
	c=(T%md);
	T/=md;
	d=(T%md);
	b+=a;
	d+=c;
	if(a<=c && d<=b) return 1;
	if(c<=a && b<=d) return 0;
	return 2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17896 KB Output is correct
2 Correct 3 ms 17440 KB Output is correct
3 Correct 5 ms 17440 KB Output is correct
4 Correct 4 ms 17440 KB Output is correct
5 Correct 4 ms 17440 KB Output is correct
6 Correct 3 ms 17440 KB Output is correct
7 Correct 4 ms 17432 KB Output is correct
8 Correct 4 ms 17692 KB Output is correct
9 Correct 4 ms 17440 KB Output is correct
10 Correct 3 ms 17440 KB Output is correct
11 Correct 4 ms 17440 KB Output is correct
12 Correct 3 ms 17436 KB Output is correct

Subtask #2
10.0 / 92.0

# Verdict Execution time Memory Grader output
1 Partially correct 125 ms 31188 KB Output is partially correct - L = 699000000
2 Partially correct 137 ms 31088 KB Output is partially correct - L = 698000000
3 Partially correct 123 ms 31104 KB Output is partially correct - L = 699000000
4 Partially correct 123 ms 31308 KB Output is partially correct - L = 699000000
5 Partially correct 259 ms 53648 KB Output is partially correct - L = 249999000000
6 Partially correct 265 ms 56420 KB Output is partially correct - L = 249999000000
7 Partially correct 258 ms 56632 KB Output is partially correct - L = 249999000000
8 Partially correct 276 ms 56248 KB Output is partially correct - L = 249999000000
9 Partially correct 247 ms 57284 KB Output is partially correct - L = 249999000000
10 Partially correct 242 ms 57424 KB Output is partially correct - L = 249999000000
11 Partially correct 240 ms 57436 KB Output is partially correct - L = 249999000000
12 Partially correct 254 ms 57684 KB Output is partially correct - L = 249999000000
13 Partially correct 252 ms 56976 KB Output is partially correct - L = 249999000000
14 Partially correct 257 ms 56924 KB Output is partially correct - L = 249999000000
15 Partially correct 137 ms 31800 KB Output is partially correct - L = 699000000
16 Partially correct 127 ms 31784 KB Output is partially correct - L = 699000000
17 Partially correct 125 ms 32288 KB Output is partially correct - L = 699000000
18 Partially correct 266 ms 56608 KB Output is partially correct - L = 249999000000
19 Partially correct 261 ms 57172 KB Output is partially correct - L = 249999000000
20 Partially correct 280 ms 56524 KB Output is partially correct - L = 249999000000
21 Partially correct 279 ms 56820 KB Output is partially correct - L = 249999000000
22 Partially correct 262 ms 56716 KB Output is partially correct - L = 249999000000
23 Partially correct 262 ms 56660 KB Output is partially correct - L = 249999000000
24 Partially correct 272 ms 56720 KB Output is partially correct - L = 249999000000
25 Partially correct 258 ms 56468 KB Output is partially correct - L = 249999000000
26 Partially correct 277 ms 56600 KB Output is partially correct - L = 249999000000
27 Partially correct 267 ms 56320 KB Output is partially correct - L = 249999000000