QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#841742#8373. MissingQingyu0 0ms0kbC++17572b2025-01-03 23:58:442025-01-04 00:07:49

Judging History

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

  • [2025-01-04 00:07:49]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2025-01-04 00:05:26]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:3ms
  • 内存:1576kb
  • [2025-01-04 00:04:06]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:3ms
  • 内存:1540kb
  • [2025-01-04 00:01:45]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:3ms
  • 内存:1588kb
  • [2025-01-04 00:00:55]
  • 管理员手动重测该提交记录
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2025-01-03 23:59:45]
  • 管理员手动重测该提交记录
  • [2025-01-03 23:58:44]
  • 评测
  • [2025-01-03 23:58:44]
  • 提交

answer

void farm1(char *msg, int *cows) {
    bool has1 = false;
    for (int i = 0; i < 50000; ++i) {
        if (cows[i] == 1) {
            has1 = true;
            break;
        }
    }
    char bit = has1 ? '1' : '0';
    for (int i = 0; i < 100; ++i) {
        msg[i] = bit;
    }
}

int farm2(char *msg, int *cows) {
    if (msg[0] == '1') {
        return 2;
    }

    bool has1 = false;
    for (int i = 0; i < 50000; ++i) {
        if (cows[i] == 1) {
            has1 = true;
            break;
        }
    }
    return has1 ? 2 : 1;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Instance #1 Time Limit Exceeded

Manager to Aisha

44774
88953
32332
67706
64706
11729
66245
8510
89031
41666
32209
90992
55227
16137
26135
57125
45787
58230
83537
14041
16042
69116
50245
37136
48707
86907
78800
23589
27146
99276
25667
93189
42419
65454
30809
87476
75351
68544
2594
31273
22038
3355
56972
78622
76962
19328
83948
47292
21200
8551
2582...

Aisha to Manager

1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111

Manager to Basma

35596
4625
3150
95130
73281
89804
82323
7023
95768
42705
36589
37075
4213
88182
49396
11457
56692
32845
34926
39045
93485
66607
65985
49866
14534
73913
87127
43977
87386
14308
69981
39853
75335
11523
14142
47832
66849
58271
89550
67214
82566
37289
55021
21022
51291
2692
24018
7904
1039
69287
38280
2...

Basma to Manager


Manager to Checker

0
translate:wrong

result: