oj.uz

Submission #351916

# Submission time Handle Problem Language Result Execution time Memory
351916 2021-01-20T09:35:30 Z beksultan04 Counting Mushrooms (IOI20_mushrooms) C++14
25 / 100
 128 ms 512 KB 
#include "mushrooms.h"
#ifndef EVAL
#include "stub.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e6+12,INF=1e9+7;
int count_mushrooms(int n) {
	vector<int> m;
	int ostatok = n-1,ans=1;
	int x = 1;
	while (x+1 < n){
        m.pb(x++);
        m.pb(0);
        m.pb(x++);
        int z = use_machine(m);
        if (z == 1)
            ans++;
        if (z == 0)ans +=2;
        m.pop_back();
        m.pop_back();
        m.pop_back();
	}
	if (x < n){
        m.pb(0);
        m.pb(x);
        ans += 1 - (use_machine(m));
	}
	ret ans;


}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:30:6: warning: unused variable 'ostatok' [-Wunused-variable]
   30 |  int ostatok = n-1,ans=1;
      |      ^~~~~~~

Subtask #1
25.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Partially correct 11 ms 364 KB Output is partially correct
7 Partially correct 128 ms 364 KB Output is partially correct
8 Partially correct 124 ms 364 KB Output is partially correct
9 Partially correct 89 ms 364 KB Output is partially correct
10 Partially correct 74 ms 364 KB Output is partially correct
11 Partially correct 89 ms 364 KB Output is partially correct
12 Partially correct 118 ms 364 KB Output is partially correct
13 Partially correct 109 ms 364 KB Output is partially correct
14 Partially correct 60 ms 364 KB Output is partially correct
15 Partially correct 93 ms 364 KB Output is partially correct
16 Partially correct 98 ms 364 KB Output is partially correct
17 Partially correct 64 ms 364 KB Output is partially correct
18 Partially correct 104 ms 364 KB Output is partially correct
19 Partially correct 88 ms 364 KB Output is partially correct
20 Partially correct 86 ms 364 KB Output is partially correct
21 Partially correct 107 ms 364 KB Output is partially correct
22 Partially correct 88 ms 364 KB Output is partially correct
23 Partially correct 87 ms 364 KB Output is partially correct
24 Partially correct 62 ms 364 KB Output is partially correct
25 Partially correct 69 ms 364 KB Output is partially correct
26 Partially correct 99 ms 364 KB Output is partially correct
27 Partially correct 88 ms 364 KB Output is partially correct
28 Partially correct 119 ms 364 KB Output is partially correct
29 Partially correct 78 ms 364 KB Output is partially correct
30 Partially correct 106 ms 364 KB Output is partially correct
31 Partially correct 118 ms 364 KB Output is partially correct
32 Partially correct 96 ms 364 KB Output is partially correct
33 Partially correct 66 ms 364 KB Output is partially correct
34 Partially correct 109 ms 364 KB Output is partially correct
35 Partially correct 98 ms 364 KB Output is partially correct
36 Partially correct 95 ms 364 KB Output is partially correct
37 Partially correct 89 ms 364 KB Output is partially correct
38 Partially correct 115 ms 364 KB Output is partially correct
39 Partially correct 96 ms 364 KB Output is partially correct
40 Partially correct 99 ms 364 KB Output is partially correct
41 Partially correct 98 ms 364 KB Output is partially correct
42 Partially correct 124 ms 364 KB Output is partially correct
43 Partially correct 122 ms 364 KB Output is partially correct
44 Partially correct 105 ms 364 KB Output is partially correct
45 Partially correct 110 ms 364 KB Output is partially correct
46 Partially correct 82 ms 364 KB Output is partially correct
47 Partially correct 116 ms 364 KB Output is partially correct
48 Partially correct 96 ms 364 KB Output is partially correct
49 Partially correct 94 ms 364 KB Output is partially correct
50 Partially correct 78 ms 512 KB Output is partially correct
51 Partially correct 104 ms 364 KB Output is partially correct
52 Partially correct 95 ms 364 KB Output is partially correct
53 Partially correct 91 ms 364 KB Output is partially correct
54 Partially correct 86 ms 364 KB Output is partially correct
55 Partially correct 87 ms 364 KB Output is partially correct
56 Partially correct 90 ms 364 KB Output is partially correct
57 Partially correct 95 ms 364 KB Output is partially correct
58 Partially correct 95 ms 364 KB Output is partially correct
59 Partially correct 91 ms 364 KB Output is partially correct
60 Partially correct 77 ms 364 KB Output is partially correct
61 Partially correct 91 ms 364 KB Output is partially correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 0 ms 364 KB Output is correct
64 Correct 0 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 0 ms 364 KB Output is correct
68 Correct 0 ms 364 KB Output is correct
69 Correct 0 ms 364 KB Output is correct
70 Correct 0 ms 364 KB Output is correct
71 Correct 0 ms 364 KB Output is correct
72 Correct 0 ms 364 KB Output is correct
73 Correct 0 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 0 ms 364 KB Output is correct
78 Correct 0 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 0 ms 364 KB Output is correct
83 Correct 0 ms 364 KB Output is correct
84 Correct 0 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 0 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 1 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct