QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #274219 | #67. Two Transportations | DaiRuiChen007 | 0 | 84ms | 19192kb | C++20 | 2.1kb | 2023-12-03 13:01:47 | 2023-12-03 13:01:49 |
Judging History
Azer
#include<bits/stdc++.h>
#include "Azer.h"
using namespace std;
namespace {
const int inf=1e9;
int n,m,dA,dB,lstdis,vA,vB,typ,rdcnt;
//typ=0:read dis,typ=1:read ver
vector <int> dis,vis;
struct Edge { int v,w; };
vector <vector<Edge>> G;
void upd(int u) {
vis[u]=true,lstdis=dis[u];
for(auto e:G[u]) dis[e.v]=min(dis[e.v],dis[u]+e.w);
vA=-1,dA=lstdis+511;
for(int i=0;i<n;++i) if(!vis[i]&&dA>dis[i]) vA=i,dA=dis[i];
if(vA==-1) return ;
dA-=lstdis,typ=0,rdcnt=9,dB=0;
for(int k=8;~k;--k) SendA((dA>>k)&1);
}
}
void InitA(int N,int A,vector<int> U,vector<int> V,vector<int> C) {
n=N,m=A,dis.resize(n,inf),vis.resize(n),G.resize(n);
for(int i=0;i<m;++i) {
G[U[i]].push_back({V[i],C[i]});
G[V[i]].push_back({U[i],C[i]});
}
dis[0]=0,upd(0);
}
void ReceiveA(bool x) {
if(typ) vB=vB*2+x;
else dB=dB*2+x;
if(!--rdcnt) {
if(typ) dis[vB]=lstdis+dB,upd(vB);
else {
if(dA<=dB) {
for(int k=10;~k;--k) SendA((vA>>k)&1);
dis[vA]=lstdis+dA,upd(vA);
} else typ=1,rdcnt=11,vB=0;
}
}
}
vector<int> Answer() { return dis; }
Baijan
#include<bits/stdc++.h>
#include "Baijan.h"
using namespace std;
namespace {
const int inf=1e9;
int n,m,dA,dB,lstdis,vA,vB,typ,rdcnt;
//typ=0:read dis,typ=1:read ver
vector <int> dis,vis;
struct Edge { int v,w; };
vector <vector<Edge>> G;
void upd(int u) {
vis[u]=true,lstdis=dis[u];
for(auto e:G[u]) dis[e.v]=min(dis[e.v],dis[u]+e.w);
vB=-1,dB=lstdis+511;
for(int i=0;i<n;++i) if(!vis[i]&&dB>dis[i]) vB=i,dB=dis[i];
if(vB==-1) return ;
dB-=lstdis,typ=0,rdcnt=9,dA=0;
for(int k=8;~k;--k) SendB((dB>>k)&1);
}
}
void InitB(int N,int B,vector<int> U,vector<int> V,vector<int> C) {
n=N,m=B,dis.resize(n,inf),vis.resize(n),G.resize(n);
for(int i=0;i<m;++i) {
G[U[i]].push_back({V[i],C[i]});
G[V[i]].push_back({U[i],C[i]});
}
dis[0]=0,upd(0);
}
void ReceiveB(bool x) {
if(typ) vA=vA*2+x;
else dA=dA*2+x;
if(!--rdcnt) {
if(typ) dis[vA]=lstdis+dA,upd(vA);
else {
if(dB<dA) {
for(int k=10;~k;--k) SendB((vB>>k)&1);
dis[vB]=lstdis+dB,upd(vB);
} else typ=1,rdcnt=11,vA=0;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3964kb
input:
-1
output:
-1 0 1 0 1 1 0 1 0 0 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '2417', found: '1000000000'
Subtask #2:
score: 0
Wrong Answer
Test #7:
score: 8
Accepted
time: 0ms
memory: 3616kb
input:
-1
output:
-1 -1
input:
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Wrong Answer
time: 1ms
memory: 3824kb
input:
-1
output:
-1 0 1 1 0 1 0 1 0 1 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '128264', found: '1000000000'
Subtask #3:
score: 0
Wrong Answer
Test #14:
score: 8
Accepted
time: 0ms
memory: 3816kb
input:
1 0 0 1 1 1 0 0 1 -1 0 0 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 1 0 -1 0 1 1 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 1 -1 0 0 0 0 0 0 1 0 0 1 1 1 0 1 1 1 0 0 0 1 -1 1 0 0 1 1 0 1 1 1 -1 0 1 0 1 1 1 0 1 1 -1 0 1 0 0 0 1 1 0 0 -1 0 0 0 1 1 1 1 0 0 -1 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 0 1 -1 1 0 0...
output:
-1 1 1 0 1 0 0 1 0 1 -1 0 0 1 1 0 1 1 0 0 -1 0 0 1 1 0 1 0 1 0 -1 0 0 0 0 1 1 1 0 1 0 1 1 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 0 -1 0 1 1 1 0 1 1 0 0 1 1 0 0 0 1 0 1 1 1 1 -1 1 1 1 0 1 1 1 0 1 1 1 0 0 1 0 1 0 0 0 0 -1 1 1 0 0 0 1 0 1 0 1 1 0 0 0 1 0 1 1 1 1 -1 1 1 0 1 1 0 1 0 0 0 1 0 0 0 1 0 1 1 1 1 -1 0...
input:
output:
0 3328 4161 4895 4209 3745 3720 4315 3313 4008 2104 3319 3666 3501 3499 3359 4244 3853 1906 392 2028 3840 3209 2376 3001 5530 2494 3340 5583 3653 3624 3798 4121 2243 4252 2165 4289 2935 6032 5124 5255 1362 3336 5054 4411 6329 4444 2299 2294 3848 5170 3200 1544 3953 3577 5969 6227 3533 4569 2619 2738...
result:
ok 2000 lines
Test #15:
score: 8
Accepted
time: 1ms
memory: 3668kb
input:
-1
output:
-1 -1
input:
output:
0
result:
ok single line: '0'
Test #16:
score: 0
Wrong Answer
time: 1ms
memory: 3900kb
input:
-1
output:
-1 0 1 1 1 1 1 1 1 1 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '420095', found: '1000000000'
Subtask #4:
score: 0
Wrong Answer
Test #24:
score: 0
Wrong Answer
time: 0ms
memory: 3744kb
input:
-1
output:
-1 0 1 0 0 1 0 0 1 1 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '1881', found: '1000000000'
Subtask #5:
score: 0
Wrong Answer
Test #38:
score: 0
Wrong Answer
time: 1ms
memory: 3700kb
input:
0 0 1 0 1 1 1 1 0 -1 -1
output:
-1 -1 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '3467', found: '1000000000'
Subtask #6:
score: 0
Wrong Answer
Test #51:
score: 0
Wrong Answer
time: 0ms
memory: 3784kb
input:
-1
output:
-1 0 1 0 1 1 0 0 0 0 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '4745', found: '1000000000'
Subtask #7:
score: 0
Wrong Answer
Test #64:
score: 16
Accepted
time: 10ms
memory: 3940kb
input:
1 1 1 1 1 0 0 0 0 -1 1 0 0 0 1 1 1 0 1 0 0 1 0 0 0 1 1 1 1 0 -1 1 0 0 0 0 1 1 0 0 1 1 1 1 1 0 1 0 1 1 1 -1 0 1 0 0 1 0 1 1 0 1 1 0 0 1 1 0 0 1 1 0 -1 1 0 0 0 1 0 1 0 1 0 1 0 1 1 1 1 1 0 1 0 -1 0 1 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0 1 -1 0 0 0 0 0 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1 -1 1 1 1 0 1 1 1 0 0 1 0...
output:
-1 1 1 1 1 1 0 0 1 1 -1 1 1 1 1 1 0 0 1 1 -1 1 1 1 1 1 0 0 1 1 -1 1 0 0 0 1 0 1 0 0 -1 1 0 0 0 1 0 0 1 1 -1 0 0 1 1 1 1 1 1 1 -1 1 1 1 1 0 1 0 0 1 -1 0 1 1 1 1 1 0 1 1 -1 1 1 0 0 0 0 0 0 0 -1 1 1 1 1 0 0 1 1 0 -1 0 1 0 0 0 0 0 0 1 -1 1 1 0 1 0 1 1 1 0 -1 1 1 1 0 1 0 1 0 0 -1 1 1 0 0 0 1 1 0 1 -1 1 1...
input:
output:
0 25855 513884 451446 379664 463677 147972 259014 115396 537065 61376 510191 95200 328777 282337 199131 72153 405843 215292 529082 413220 99569 275396 215884 52889 281825 182731 64473 510973 545141 417123 190844 319517 483688 15462 490221 521781 384795 539004 457181 146029 122086 1730 31958 265013 7...
result:
ok 2000 lines
Test #65:
score: 16
Accepted
time: 84ms
memory: 19192kb
input:
0 0 0 1 0 1 1 1 1 -1 0 0 0 0 1 0 1 0 1 -1 0 0 0 0 0 1 1 1 1 -1 0 0 0 0 0 1 0 0 1 -1 0 0 0 0 0 0 1 1 1 -1 0 0 0 0 1 1 0 1 0 -1 0 0 0 0 1 1 0 0 1 -1 0 0 0 0 1 0 1 0 0 -1 0 0 0 0 0 1 1 1 0 -1 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 1 0 1 1 1 -1 0 0 0 0 1 0 0 0 1 -1 0 0 0 0 1 1 0 1 1 -1 0 0 0 0 1 0 1 1 0 -1 0 0 0 ...
output:
-1 0 0 0 0 0 0 0 1 1 0 1 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 1 1 0 -1 1 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 0 -1 1 0 1 0 1 1 1 0 1 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 -1 0 1 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 -1 0 0 1 1 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 1 -1 1 1 1 0 1 0 1 1 1 0 1...
input:
output:
0 6187 1398 17 6163 4742 4598 2337 2237 6475 6001 5268 2245 6132 4925 1482 4253 1962 6642 2449 2704 3396 5449 2492 706 835 1879 3203 6855 4265 546 1231 2390 2300 4651 1353 1673 6724 6753 360 4275 6749 3400 1385 2945 6010 5339 226 2511 4558 1033 4708 4330 1882 1185 3535 5071 3843 1252 110 6571 6727 3...
result:
ok 2000 lines
Test #66:
score: 16
Accepted
time: 74ms
memory: 17320kb
input:
0 0 0 0 0 0 1 1 0 -1 1 1 1 0 1 1 1 0 0 1 0 0 0 0 0 1 1 1 0 0 -1 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 0 0 0 1 0 0 1 0 -1 0 0 0 0 0 0 1 0 0 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 0 -1 0 0 0 0 0 0 1 1 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 1 0 1 0 0 -1 0 0 0 0 0 0 0 1 1 1 0 1 1 0 0 1 0 1 1 1 0 0 0 1 0 1 1...
output:
-1 0 0 1 0 1 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 1 1 0 1 0 0 0 1 1 1 0 0 1 0 0 0 0 1 0 0 1 1 -1 0 0 0 0 0 0 0 1 0 1 0 1 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 1 -1 0 0 0 0 0 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 0 1 1 1 0 0 0 1 1 0 1 ...
input:
output:
0 5455 4313 3996 4463 4115 2413 1141 7939 4669 5854 7806 7612 3394 7713 441 4956 1630 751 2070 4241 6754 3518 3736 3158 549 4590 6798 842 1597 7637 3679 6104 7953 5654 3951 1877 2075 5983 6633 5724 2967 2362 527 7670 3759 3471 4089 508 1187 5437 3533 3003 7429 7499 5966 7484 949 1545 1862 542 3370 1...
result:
ok 2000 lines
Test #67:
score: 0
Wrong Answer
time: 2ms
memory: 3908kb
input:
-1
output:
-1 0 0 0 1 0 0 1 1 0 -1
input:
output:
0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1...
result:
wrong answer 2nd lines differ - expected: '79964', found: '1000000000'