oj.uz

답안 #116969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116969 2019-06-14T09:54:31 Z tmwilliamlin168 City (JOI17_city) C++14
100 / 100
 596 ms 56272 KB 
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=2.5e5, B=1<<8;
vector<int> adj[mxN];
int s[mxN], dt1, dt2;

int encrange(int a, int b) {
	return b*(b-1)/2+a;
}

void dfs2(int u) {
	int ds=dt2++;
	for(int v : adj[u])
		dfs2(v);
	Code(u, 1<<26|dt1<<15|encrange(ds, dt2));
}

void dfs1(int u=0, int p=-1, int d=0) {
	int ds=dt1;
	s[u]=1;
	if(~p)
		adj[u].erase(find(adj[u].begin(), adj[u].end(), p));
	for(int v : adj[u]) {
		dfs1(v, u, d+1);
		s[u]+=s[v];
	}
	if(u&&s[u]<B)
		return;
	sort(adj[u].begin(), adj[u].end(), [](const int &a, const int &b) {
		return s[a]<s[b];
	});
	for(int i=0, cs; i<adj[u].size()&&s[adj[u][i]]<B; ++dt1) {
		dt2=0, cs=0;
		while(i<adj[u].size()&&cs+s[adj[u][i]]<B) {
			cs+=s[adj[u][i]];
			dfs2(adj[u][i++]);
		}
	}
	Code(u, d<<21|encrange(ds, dt1));
}

void Encode(int n, int a[], int b[]) {
	for(int i=0; i<n-1; ++i) {
		adj[a[i]].push_back(b[i]);
		adj[b[i]].push_back(a[i]);
	}
	dfs1();
}
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;

void InitDevice() {}

array<int, 2> decrange(int x) {
	int l=1, r=1<<11;
	while(l<r) {
		int m=(l+r+1)/2;
		if(m*(m-1)/2<=x)
			l=m;
		else
			r=m-1;
	}
	return {x-r*(r-1)/2, r};
}

int Answer(long long s, long long t) {
	if(s>>26&&t>>26) {
		if((s>>15^t>>15)&(1<<11)-1)
			return 2;
		array<int, 2> rs=decrange(s&(1<<15)-1), rt=decrange(t&(1<<15)-1);
		if(rs[0]<=rt[0]&&rt[0]<rs[1])
			return 1;
		if(rt[0]<=rs[0]&&rs[0]<rt[1])
			return 0;
		return 2;
	}
	if(s>>26) {
		int x=s>>15&(1<<11)-1;
		array<int, 2> r=decrange(t&(1<<21)-1);
		return r[0]<=x&&x<r[1]?0:2;
	}
	if(t>>26) {
		int x=t>>15&(1<<11)-1;
		array<int, 2> r=decrange(s&(1<<21)-1);
		return r[0]<=x&&x<r[1]?1:2;
	}
	int sd=s>>21, td=t>>21;
	array<int, 2> rs=decrange(s&(1<<21)-1), rt=decrange(t&(1<<21)-1);
	if(td>sd&&rs[0]<=rt[0]&&rt[0]<rs[1])
		return 1;
	if(sd>td&&rt[0]<=rs[0]&&rs[0]<rt[1])
		return 0;
	return 2;
}

Compilation message

Encoder.cpp: In function 'void dfs1(int, int, int)':
Encoder.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0, cs; i<adj[u].size()&&s[adj[u][i]]<B; ++dt1) {
                   ~^~~~~~~~~~~~~~
Encoder.cpp:36:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i<adj[u].size()&&cs+s[adj[u][i]]<B) {
         ~^~~~~~~~~~~~~~

Device.cpp: In function 'int Answer(long long int, long long int)':
Device.cpp:21:27: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   if((s>>15^t>>15)&(1<<11)-1)
                    ~~~~~~~^~
Device.cpp:23:38: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   array<int, 2> rs=decrange(s&(1<<15)-1), rt=decrange(t&(1<<15)-1);
                               ~~~~~~~^~
Device.cpp:23:64: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   array<int, 2> rs=decrange(s&(1<<15)-1), rt=decrange(t&(1<<15)-1);
                                                         ~~~~~~~^~
Device.cpp:31:22: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   int x=s>>15&(1<<11)-1;
               ~~~~~~~^~
Device.cpp:32:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   array<int, 2> r=decrange(t&(1<<21)-1);
                              ~~~~~~~^~
Device.cpp:36:22: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   int x=t>>15&(1<<11)-1;
               ~~~~~~~^~
Device.cpp:37:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   array<int, 2> r=decrange(s&(1<<21)-1);
                              ~~~~~~~^~
Device.cpp:41:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
  array<int, 2> rs=decrange(s&(1<<21)-1), rt=decrange(t&(1<<21)-1);
                              ~~~~~~~^~
Device.cpp:41:63: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
  array<int, 2> rs=decrange(s&(1<<21)-1), rt=decrange(t&(1<<21)-1);
                                                        ~~~~~~~^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12288 KB Output is correct
2 Correct 8 ms 12544 KB Output is correct
3 Correct 8 ms 12544 KB Output is correct
4 Correct 7 ms 12288 KB Output is correct
5 Correct 9 ms 12544 KB Output is correct
6 Correct 9 ms 12288 KB Output is correct
7 Correct 9 ms 12544 KB Output is correct
8 Correct 9 ms 12544 KB Output is correct
9 Correct 9 ms 12544 KB Output is correct
10 Correct 9 ms 12544 KB Output is correct
11 Correct 9 ms 12544 KB Output is correct
12 Correct 9 ms 12544 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 20976 KB Output is correct - L = 67218045
2 Correct 198 ms 20720 KB Output is correct - L = 67273028
3 Correct 377 ms 20976 KB Output is correct - L = 67283581
4 Correct 196 ms 20976 KB Output is correct - L = 67207039
5 Correct 563 ms 55072 KB Output is correct - L = 120077176
6 Correct 571 ms 55072 KB Output is correct - L = 119270012
7 Correct 555 ms 55024 KB Output is correct - L = 120242996
8 Correct 596 ms 54392 KB Output is correct - L = 99123071
9 Correct 467 ms 56024 KB Output is correct - L = 101318527
10 Correct 459 ms 56016 KB Output is correct - L = 99657640
11 Correct 451 ms 56272 KB Output is correct - L = 99713024
12 Correct 417 ms 56224 KB Output is correct - L = 99647488
13 Correct 522 ms 55776 KB Output is correct - L = 108584254
14 Correct 546 ms 55272 KB Output is correct - L = 114983772
15 Correct 193 ms 20976 KB Output is correct - L = 67245713
16 Correct 181 ms 20976 KB Output is correct - L = 67274356
17 Correct 194 ms 20976 KB Output is correct - L = 67221532
18 Correct 519 ms 55264 KB Output is correct - L = 99713029
19 Correct 491 ms 55264 KB Output is correct - L = 99385344
20 Correct 519 ms 55288 KB Output is correct - L = 99353610
21 Correct 524 ms 55008 KB Output is correct - L = 100368404
22 Correct 508 ms 55240 KB Output is correct - L = 99319813
23 Correct 551 ms 54744 KB Output is correct - L = 99301235
24 Correct 546 ms 55024 KB Output is correct - L = 99483683
25 Correct 584 ms 54768 KB Output is correct - L = 99389903
26 Correct 572 ms 54768 KB Output is correct - L = 99498872
27 Correct 568 ms 54096 KB Output is correct - L = 99714619