| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 427339 |
2021-06-14T14:24:30 Z |
tqbfjotld |
City (JOI17_city) |
C++14 |
|
1036 ms |
57356 KB |
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
int lch[500005];
int rch[500005];
int curnodes,n;
vector<int> adjl[250005];
double const1 = 0.0;
double const2 = 1.0;
const int cutoffval = 16;
double func(int node, int pa){
set<pair<double,int> > stuff;
for (auto x : adjl[node]){
if (x==pa) continue;
double res = func(x,node);
stuff.insert({res,x});
}
while (stuff.size()>2){
auto i1 = *stuff.begin();
stuff.erase(stuff.begin());
pair<double,int> thing = {-999.0,-1};
auto it = stuff.lower_bound({i1.first+const1,-1});
if (it!=stuff.end()){
thing = (*it);
}
if (it!=stuff.begin()){
it--;
if (abs(thing.first-(i1.first+const1))>=abs((*it).first-(i1.first+const1))){
thing = *it;
}
}
auto i2 = thing;
stuff.erase(stuff.lower_bound(thing));
int nw = curnodes++;
lch[nw] = i2.second;
rch[nw] = i1.second;
stuff.insert({max(i2.first+const2,i1.first+const1+const2),nw});
}
if (stuff.size()==2){
auto i1 = *stuff.begin();
stuff.erase(stuff.begin());
auto i2 = *stuff.begin();
stuff.erase(stuff.begin());
lch[node] = i2.second;
rch[node] = i1.second;
return max(i2.first+const2,i1.first+const1+const2);
}
if (stuff.size()==1){
auto i1 = *stuff.begin();
lch[node] = i1.second;
return i1.first+const2;
}
return 0.0;
}
void dfs2(int node, long long curamt, int pos, int h){
//printf("ch of %d = %d %d\n",node,lch[node],rch[node]);
if (node<n){
// printf("code %d %lld\n",node,curamt+(1LL<<pos));
Code(node,curamt+(1LL<<pos));
}
if (h>=cutoffval){
if (lch[node]!=-1){
dfs2(lch[node],curamt,pos+1,h+1);
}
if (rch[node]!=-1){
dfs2(rch[node],curamt+(1LL<<pos),pos+1,h+1);
}
return;
}
if (lch[node]!=-1){
if (lch[node]<n) Code(lch[node],curamt+(5LL<<pos));
if (lch[lch[node]]!=-1){
dfs2(lch[lch[node]],curamt,pos+1,h+2);
}
if (rch[lch[node]]!=-1){
dfs2(rch[lch[node]],curamt+(1LL<<pos),pos+3,h+2);
}
}
if (rch[node]!=-1){
if (rch[node]<n) Code(rch[node],curamt+(7LL<<pos));
if (lch[rch[node]]!=-1){
dfs2(lch[rch[node]],curamt+(3LL<<pos),pos+3,h+2);
}
if (rch[rch[node]]!=-1){
dfs2(rch[rch[node]],curamt+(7LL<<pos),pos+3,h+2);
}
}
}
void Encode(int N, int A[], int B[])
{
n = N;
memset(lch,-1,sizeof(lch));
memset(rch,-1,sizeof(rch));
curnodes = N;
for (int x = 0; x<N-1; x++){
adjl[A[x]].push_back(B[x]);
adjl[B[x]].push_back(A[x]);
}
func(0,-1);
dfs2(0,0,0,0);
}
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
const int cutoffval = 16;
void InitDevice()
{
}
int Answer(long long S, long long T)
{
string s1,s2;
for (int x = 0; x<64; x++){
if (S)s1.push_back((S&1)?'1':'0');
S>>=1;
if (T)s2.push_back((T&1)?'1':'0');
T>>=1;
}
s1.pop_back();
s2.pop_back();
int h = 0;
for (int x = 0; x<min(s1.size(),s2.size());){
if (h>=cutoffval){
if (s1[x]!=s2[x]) return 2;
x++;
continue;
}
if (s1[x]=='0'){
if (s2[x]=='0') {
x++; h+=2; continue;
}
if (s2[x+1]=='0'){
if (s2.size()==x+2){
return 0;
}
}
return 2;
}
else if (s2[x]=='0'){
if (s1[x+1]=='0'){
if (s1.size()==x+2){
return 1;
}
}
return 2;
}
else if (min(s1.size(),s2.size())==x+2){
if (s1[x]==s2[x] && s1[x+1]==s2[x+1]) {
x+=2;
h += 1;
continue;
}
else{
return 2;
}
}
else{
if (s1[x]==s2[x] && s1[x+1]==s2[x+1] && s1[x+2]==s2[x+2]){
x+=3;
h+=2;
continue;
}
return 2;
}
}
//printf("cmp %s %s\n",s1.c_str(),s2.c_str());
return s1.size()<s2.size()?1:0;
if (s1.size()<s2.size()){
for (int x = 0; x<s1.size(); x++){
if (s1[x]!=s2[x]) return 2;
}
return 1;
}
for (int x = 0; x<s2.size(); x++){
if (s1[x]!=s2[x]) return 2;
}
return 0;
}
Compilation message
Device.cpp: In function 'int Answer(long long int, long long int)':
Device.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
23 | for (int x = 0; x<min(s1.size(),s2.size());){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~
Device.cpp:34:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
34 | if (s2.size()==x+2){
| ~~~~~~~~~^~~~~
Device.cpp:42:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
42 | if (s1.size()==x+2){
| ~~~~~~~~~^~~~~
Device.cpp:48:42: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
48 | else if (min(s1.size(),s2.size())==x+2){
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
Device.cpp:70:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
70 | for (int x = 0; x<s1.size(); x++){
| ~^~~~~~~~~~
Device.cpp:75:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
75 | for (int x = 0; x<s2.size(); x++){
| ~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
10368 KB |
Output is correct |
| 2 |
Correct |
8 ms |
10280 KB |
Output is correct |
| 3 |
Correct |
6 ms |
10284 KB |
Output is correct |
| 4 |
Correct |
7 ms |
10368 KB |
Output is correct |
| 5 |
Correct |
6 ms |
10352 KB |
Output is correct |
| 6 |
Correct |
6 ms |
10372 KB |
Output is correct |
| 7 |
Correct |
7 ms |
10388 KB |
Output is correct |
| 8 |
Correct |
7 ms |
10308 KB |
Output is correct |
| 9 |
Correct |
7 ms |
10376 KB |
Output is correct |
| 10 |
Correct |
8 ms |
10368 KB |
Output is correct |
| 11 |
Correct |
8 ms |
10364 KB |
Output is correct |
| 12 |
Correct |
8 ms |
10372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
301 ms |
18856 KB |
Output is correct - L = 373465 |
| 2 |
Correct |
280 ms |
18756 KB |
Output is correct - L = 176678 |
| 3 |
Correct |
262 ms |
18868 KB |
Output is correct - L = 177883 |
| 4 |
Correct |
269 ms |
18840 KB |
Output is correct - L = 32761 |
| 5 |
Partially correct |
717 ms |
41104 KB |
Output is partially correct - L = 16242808411 |
| 6 |
Partially correct |
716 ms |
41024 KB |
Output is partially correct - L = 7535959643 |
| 7 |
Partially correct |
721 ms |
41088 KB |
Output is partially correct - L = 6449771097 |
| 8 |
Correct |
645 ms |
40652 KB |
Output is correct - L = 67108863 |
| 9 |
Correct |
858 ms |
55740 KB |
Output is correct - L = 268434432 |
| 10 |
Correct |
993 ms |
57260 KB |
Output is correct - L = 268434432 |
| 11 |
Correct |
1036 ms |
57292 KB |
Output is correct - L = 268434432 |
| 12 |
Correct |
928 ms |
57356 KB |
Output is correct - L = 268434432 |
| 13 |
Partially correct |
768 ms |
49244 KB |
Output is partially correct - L = 1916983652 |
| 14 |
Partially correct |
696 ms |
44208 KB |
Output is partially correct - L = 981883772 |
| 15 |
Correct |
273 ms |
18828 KB |
Output is correct - L = 308953 |
| 16 |
Correct |
283 ms |
18824 KB |
Output is correct - L = 1348297 |
| 17 |
Correct |
272 ms |
18872 KB |
Output is correct - L = 234185 |
| 18 |
Correct |
827 ms |
48612 KB |
Output is correct - L = 134213888 |
| 19 |
Correct |
869 ms |
48968 KB |
Output is correct - L = 134186240 |
| 20 |
Correct |
829 ms |
49020 KB |
Output is correct - L = 134059008 |
| 21 |
Correct |
770 ms |
46396 KB |
Output is correct - L = 134217216 |
| 22 |
Correct |
759 ms |
47132 KB |
Output is correct - L = 167771264 |
| 23 |
Correct |
764 ms |
44356 KB |
Output is correct - L = 167771264 |
| 24 |
Correct |
738 ms |
45740 KB |
Output is correct - L = 267971968 |
| 25 |
Partially correct |
770 ms |
43388 KB |
Output is partially correct - L = 1073153600 |
| 26 |
Partially correct |
903 ms |
43604 KB |
Output is partially correct - L = 534853568 |
| 27 |
Partially correct |
896 ms |
43292 KB |
Output is partially correct - L = 1070194656 |
