oj.uz

답안 #884485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884485 2023-12-07T13:34:38 Z weajink 버섯 세기 (IOI20_mushrooms) C++17
80.7143 / 100
 6 ms 968 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef LOCAL
#define debug(...) __VA_ARGS__
#else
#define debug(...) {}
#endif

int count_mushrooms(int n){
    vector<int> znane[2];
    znane[0].push_back(0);
    int ile[2];
    ile[0] = 1;
    ile[1] = 0;
    int akt = 1;
    while (akt < n){
        bool better = (znane[0].size()<znane[1].size());
        int pt = 0;
        vector<int> zap;
        for (; akt < n && pt < znane[better].size(); akt++,pt++){
            zap.push_back(znane[better][pt]);
            zap.push_back(akt);
        }
        int wy = use_machine(zap);
        if (wy%2) znane[!better].push_back(akt-1);
        else znane[better].push_back(akt-1);
        ile[better] += pt-(wy+1)/2;
        ile[!better] += (wy+1)/2;
    }
    return ile[0];
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:22:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for (; akt < n && pt < znane[better].size(); akt++,pt++){
      |                           ~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
80.7143 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 4 ms 480 KB Output is correct
8 Correct 4 ms 472 KB Output is correct
9 Correct 4 ms 476 KB Output is correct
10 Partially correct 6 ms 480 KB Output is partially correct
11 Partially correct 5 ms 480 KB Output is partially correct
12 Partially correct 5 ms 476 KB Output is partially correct
13 Correct 5 ms 480 KB Output is correct
14 Correct 3 ms 968 KB Output is correct
15 Partially correct 5 ms 480 KB Output is partially correct
16 Partially correct 5 ms 484 KB Output is partially correct
17 Correct 3 ms 968 KB Output is correct
18 Correct 4 ms 480 KB Output is correct
19 Partially correct 5 ms 476 KB Output is partially correct
20 Partially correct 5 ms 476 KB Output is partially correct
21 Partially correct 5 ms 480 KB Output is partially correct
22 Partially correct 5 ms 480 KB Output is partially correct
23 Correct 5 ms 480 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Partially correct 5 ms 484 KB Output is partially correct
26 Partially correct 5 ms 476 KB Output is partially correct
27 Partially correct 5 ms 480 KB Output is partially correct
28 Partially correct 5 ms 480 KB Output is partially correct
29 Partially correct 4 ms 480 KB Output is partially correct
30 Partially correct 5 ms 708 KB Output is partially correct
31 Partially correct 5 ms 704 KB Output is partially correct
32 Partially correct 5 ms 472 KB Output is partially correct
33 Partially correct 5 ms 480 KB Output is partially correct
34 Partially correct 5 ms 480 KB Output is partially correct
35 Partially correct 5 ms 476 KB Output is partially correct
36 Partially correct 5 ms 636 KB Output is partially correct
37 Partially correct 6 ms 480 KB Output is partially correct
38 Partially correct 5 ms 476 KB Output is partially correct
39 Partially correct 5 ms 488 KB Output is partially correct
40 Partially correct 5 ms 476 KB Output is partially correct
41 Partially correct 5 ms 476 KB Output is partially correct
42 Partially correct 5 ms 480 KB Output is partially correct
43 Partially correct 5 ms 484 KB Output is partially correct
44 Partially correct 5 ms 492 KB Output is partially correct
45 Partially correct 4 ms 480 KB Output is partially correct
46 Partially correct 5 ms 488 KB Output is partially correct
47 Partially correct 6 ms 736 KB Output is partially correct
48 Partially correct 5 ms 740 KB Output is partially correct
49 Partially correct 5 ms 492 KB Output is partially correct
50 Partially correct 5 ms 484 KB Output is partially correct
51 Partially correct 5 ms 488 KB Output is partially correct
52 Partially correct 5 ms 720 KB Output is partially correct
53 Partially correct 5 ms 480 KB Output is partially correct
54 Partially correct 5 ms 476 KB Output is partially correct
55 Partially correct 6 ms 484 KB Output is partially correct
56 Partially correct 6 ms 476 KB Output is partially correct
57 Partially correct 5 ms 476 KB Output is partially correct
58 Partially correct 5 ms 736 KB Output is partially correct
59 Partially correct 5 ms 476 KB Output is partially correct
60 Partially correct 4 ms 484 KB Output is partially correct
61 Partially correct 6 ms 720 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 1 ms 504 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 340 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 596 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct