QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#26142#67. Two TransportationsQingyu0 172ms3140kbC++201002b2022-04-06 18:18:382023-01-15 11:46:22

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-15 11:46:22]
  • 评测
  • 测评结果：0
  • 用时：172ms
  • 内存：3140kb
查看
  • [2022-04-06 18:18:38]
  • 提交

Azer

#include "Azer.h"
#include <vector>

namespace {

int N;
int variable_example[500000];
int count;

}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
  ::N = N;
  for (int i = 0; i < A; ++i) {
    variable_example[i] = U[i] + V[i] - C[i];
  }
  SendA(true);
  count = 1;
}

void ReceiveA(bool x) {
  ++count;
  if (count < 58000) {
    SendA(x);
    ++count;
  }
}

std::vector<int> Answer() {
  std::vector<int> ans(N);
  for (int k = 0; k < N; ++k) {
    ans[k] = variable_example[k];
  }
  return ans;
}
Source code, Language: C++20

Baijan

#include "Baijan.h"
#include <vector>

namespace {

int N;
int count;

bool FunctionExample(bool P) {
  return !P;
}

}  // namespace

void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
  ::N = N;
  count = 0;
}

void ReceiveB(bool y) {
  ++count;
  if (count < 58000) {
    SendB(FunctionExample(y));
    ++count;
  }
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 122ms
memory: 3108kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

wrong answer 2nd lines differ - expected: '2417', found: '0'

Subtask #2:

score: 0
Wrong Answer

Test #7:

score: 8
Accepted
time: 142ms
memory: 3064kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Wrong Answer
time: 172ms
memory: 3076kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

608
2624
1147
2061
2662
929
2527
713
2271
1895
2399
3439
898
1241
2245
2716
2906
1413
1288
1116
1130
2601
2721
632
3059
2110
523
2052
2881
1961
1872
1613
86
2376
1364
2907
2396
-64
3634
1873
1986
2921
3244
1253
2661
2839
1805
2272
1323
1822
1826
3557
498
2596
1842
1177
463
3198
2196
1511
2516
2436
1...

result:

wrong answer 1st lines differ - expected: '0', found: '608'

Subtask #3:

score: 0
Wrong Answer

Test #14:

score: 0
Wrong Answer
time: 142ms
memory: 3140kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

2370
395
2041
369
2944
2458
1682
2363
2782
2013
2105
1867
362
1482
2444
1546
1620
3090
1772
1573
929
1998
1739
1036
1270
2340
2179
2898
1654
2744
1268
2121
1660
424
1515
1630
501
2102
1036
686
713
1878
2600
2600
1858
2168
1299
1994
1234
1051
1529
2880
1676
1160
625
1998
682
1062
1340
1658
1979
544
1...

result:

wrong answer 1st lines differ - expected: '0', found: '2370'

Subtask #4:

score: 0
Wrong Answer

Test #24:

score: 0
Wrong Answer
time: 102ms
memory: 3072kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

480
830
1236
563
771
591
314
259
494
897
688
176
433
659
438
755
1351
910
856
131
541
910
923
753
464
894
1014
857
1471
828
750
934
732
498
172
408
1207
676
293
358
509
107
774
447
812
533
376
64
879
743
1113
542
1160
615
734
484
-119
849
1026
303
596
772
555
592
1102
749
218
526
608
898
1157
1550
1...

result:

wrong answer 1st lines differ - expected: '0', found: '480'

Subtask #5:

score: 0
Wrong Answer

Test #38:

score: 0
Wrong Answer
time: 102ms
memory: 3060kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

662
83
1057
511
500
1264
253
1526
466
437
353
982
283
1496
934
715
957
708
-54
1477
235
947
902
1240
1218
1067
1075
909
1099
769
544
606
706
1132
1945
1093
756
868
1770
598
927
827
1850
657
1357
916
1417
1000
735
1096
500
829
1349
40
1469
1769
1660
893
676
544
1251
374
546
213
897
1288
1072
1103
101...

result:

wrong answer 1st lines differ - expected: '0', found: '662'

Subtask #6:

score: 0
Wrong Answer

Test #51:

score: 0
Wrong Answer
time: 77ms
memory: 3064kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

515
1858
2342
1627
2584
1818
772
1256
288
956
859
2214
406
350
129
-42
1403
1050
1466
349
1787
702
729
1104
1136
948
148
424
98
1963
1090
82
586
1213
2039
368
1516
67
925
711
1258
-91
11
545
1751
630
1337
1917
1798
300
983
743
2035
1762
1588
685
2351
494
1524
1155
2051
1293
591
1201
800
1460
1095
28...

result:

wrong answer 1st lines differ - expected: '0', found: '515'

Subtask #7:

score: 0
Wrong Answer

Test #64:

score: 0
Wrong Answer
time: 147ms
memory: 3132kb

input:

1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
...

output:

-1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 -1
0 -1
1 ...

input:

output:

2868
1844
740
445
1328
1549
2169
981
1688
1740
3024
1801
1198
-205
1442
2079
600
1612
864
2388
1304
589
225
1589
1500
2345
684
1922
2485
1115
456
1672
2209
1821
2310
1401
2382
1095
2226
853
628
1591
2855
225
2573
1043
1243
157
1826
1982
-256
1900
2818
1157
3609
276
1988
2329
1186
1698
2191
956
1733
...

result:

wrong answer 1st lines differ - expected: '0', found: '2868'
English 繁體中文 简体中文

Server Time: 2025-02-01 13:53:31 | OpenSource Project