oj.uz

답안 #432594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432594 2021-06-18T11:26:33 Z Blistering_Barnacles 버섯 세기 (IOI20_mushrooms) C++14
25 / 100
 133 ms 13348 KB 
#include "mushrooms.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
int count_mushrooms(int n) {
	ll ret = 1 ;
	for(ll i = 2 ; i < n ; i += 2){
        ll pp = use_machine({i - 1 , 0 , i}) ;
        if(pp == 2)C ;
        if(!pp)ret += 2 ;
        else ret++ ;
	}
	if(!(n & 1)){
        ll pp = use_machine({n - 1 , 0}) ;
        ret += !pp ;
	}
	R ret ;
}

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 13256 KB Output is correct
2 Correct 10 ms 13228 KB Output is correct
3 Correct 9 ms 13256 KB Output is correct
4 Correct 11 ms 13256 KB Output is correct
5 Correct 11 ms 13256 KB Output is correct
6 Partially correct 20 ms 13224 KB Output is partially correct
7 Partially correct 103 ms 13256 KB Output is partially correct
8 Partially correct 89 ms 13256 KB Output is partially correct
9 Partially correct 128 ms 13256 KB Output is partially correct
10 Partially correct 89 ms 13256 KB Output is partially correct
11 Partially correct 112 ms 13256 KB Output is partially correct
12 Partially correct 91 ms 13256 KB Output is partially correct
13 Partially correct 133 ms 13244 KB Output is partially correct
14 Partially correct 53 ms 13256 KB Output is partially correct
15 Partially correct 79 ms 13256 KB Output is partially correct
16 Partially correct 93 ms 13256 KB Output is partially correct
17 Partially correct 63 ms 13256 KB Output is partially correct
18 Partially correct 99 ms 13256 KB Output is partially correct
19 Partially correct 102 ms 13256 KB Output is partially correct
20 Partially correct 98 ms 13256 KB Output is partially correct
21 Partially correct 117 ms 13256 KB Output is partially correct
22 Partially correct 73 ms 13256 KB Output is partially correct
23 Partially correct 84 ms 13256 KB Output is partially correct
24 Partially correct 58 ms 13256 KB Output is partially correct
25 Partially correct 113 ms 13260 KB Output is partially correct
26 Partially correct 89 ms 13256 KB Output is partially correct
27 Partially correct 103 ms 13256 KB Output is partially correct
28 Partially correct 112 ms 13328 KB Output is partially correct
29 Partially correct 92 ms 13256 KB Output is partially correct
30 Partially correct 98 ms 13256 KB Output is partially correct
31 Partially correct 105 ms 13240 KB Output is partially correct
32 Partially correct 97 ms 13344 KB Output is partially correct
33 Partially correct 116 ms 13348 KB Output is partially correct
34 Partially correct 62 ms 13256 KB Output is partially correct
35 Partially correct 93 ms 13256 KB Output is partially correct
36 Partially correct 60 ms 13256 KB Output is partially correct
37 Partially correct 131 ms 13256 KB Output is partially correct
38 Partially correct 65 ms 13256 KB Output is partially correct
39 Partially correct 99 ms 13296 KB Output is partially correct
40 Partially correct 99 ms 13256 KB Output is partially correct
41 Partially correct 74 ms 13256 KB Output is partially correct
42 Partially correct 96 ms 13256 KB Output is partially correct
43 Partially correct 116 ms 13256 KB Output is partially correct
44 Partially correct 109 ms 13256 KB Output is partially correct
45 Partially correct 118 ms 13256 KB Output is partially correct
46 Partially correct 99 ms 13256 KB Output is partially correct
47 Partially correct 101 ms 13256 KB Output is partially correct
48 Partially correct 100 ms 13256 KB Output is partially correct
49 Partially correct 63 ms 13256 KB Output is partially correct
50 Partially correct 112 ms 13256 KB Output is partially correct
51 Partially correct 100 ms 13256 KB Output is partially correct
52 Partially correct 107 ms 13256 KB Output is partially correct
53 Partially correct 97 ms 13256 KB Output is partially correct
54 Partially correct 131 ms 13256 KB Output is partially correct
55 Partially correct 101 ms 13256 KB Output is partially correct
56 Partially correct 100 ms 13256 KB Output is partially correct
57 Partially correct 103 ms 13256 KB Output is partially correct
58 Partially correct 82 ms 13256 KB Output is partially correct
59 Partially correct 89 ms 13256 KB Output is partially correct
60 Partially correct 97 ms 13256 KB Output is partially correct
61 Partially correct 104 ms 13256 KB Output is partially correct
62 Correct 9 ms 13256 KB Output is correct
63 Correct 9 ms 13256 KB Output is correct
64 Correct 10 ms 13256 KB Output is correct
65 Correct 10 ms 13232 KB Output is correct
66 Correct 9 ms 13256 KB Output is correct
67 Correct 9 ms 13256 KB Output is correct
68 Correct 9 ms 13256 KB Output is correct
69 Correct 10 ms 13324 KB Output is correct
70 Correct 10 ms 13256 KB Output is correct
71 Correct 9 ms 13256 KB Output is correct
72 Correct 9 ms 13256 KB Output is correct
73 Correct 9 ms 13256 KB Output is correct
74 Correct 9 ms 13256 KB Output is correct
75 Correct 9 ms 13256 KB Output is correct
76 Correct 9 ms 13256 KB Output is correct
77 Correct 9 ms 13256 KB Output is correct
78 Correct 10 ms 13256 KB Output is correct
79 Correct 10 ms 13228 KB Output is correct
80 Correct 10 ms 13256 KB Output is correct
81 Correct 11 ms 13336 KB Output is correct
82 Correct 9 ms 13256 KB Output is correct
83 Correct 9 ms 13256 KB Output is correct
84 Correct 9 ms 13256 KB Output is correct
85 Correct 9 ms 13256 KB Output is correct
86 Correct 9 ms 13256 KB Output is correct
87 Correct 10 ms 13256 KB Output is correct
88 Correct 10 ms 13256 KB Output is correct
89 Correct 9 ms 13256 KB Output is correct
90 Correct 9 ms 13256 KB Output is correct
91 Correct 9 ms 13276 KB Output is correct