oj.uz

Submission #307658

# Submission time Handle Problem Language Result Execution time Memory
307658 2020-09-29T02:49:42 Z vivaan_gupta Counting Mushrooms (IOI20_mushrooms) C++14
10 / 100
 170 ms 384 KB 
		#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "mushrooms.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;

 
const ll INF = 1e12;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
// int a[N];
// int use_machine(vector<int> v){
// 	int d= 0 ;
// 	for(int i =0 ;i<v.size()-1;i++){
// 		d+=(a[v[i]]!=a[v[i+1]]);
// 	}
// 	return d;
// }
int count_mushrooms(int n){
	int B =0;
	for(int i = 0;i<(n-1);i+=2){
		vector<int> v;
		v.pb(i),v.pb(i+1);
		int x=  use_machine(v);
		if(x == 0){
			vector<int> tmp = {0,i+1};
			if(use_machine(tmp) == 1)
				B += 2;
			continue;
		}
		B+=1;
	}
	vector<int> v;
	if(n&1){
		v.pb(0);
		v.pb(n-1);
		B += use_machine(v);
	}
	return n-B;
}
// signed main(){
// 	int n;
// 	cin >> n;
// 	for(int i = 0;i<n;i++){
// 		cin >> a[i];
// 	}
// 	cout << count_mushrooms(n) << endl;
// }

// signed main(){
 
//     ios_base::sync_with_stdio(0);
//     cin.tie(NULL);
//      // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
//      ll tt=1;   
//      // cin >> tt;
//     while(tt--){    
//         solve();
//     }    
// }

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Partially correct 15 ms 256 KB Output is partially correct
7 Partially correct 160 ms 256 KB Output is partially correct
8 Partially correct 170 ms 256 KB Output is partially correct
9 Partially correct 165 ms 368 KB Output is partially correct
10 Partially correct 145 ms 256 KB Output is partially correct
11 Partially correct 144 ms 256 KB Output is partially correct
12 Partially correct 129 ms 256 KB Output is partially correct
13 Partially correct 150 ms 256 KB Output is partially correct
14 Partially correct 71 ms 384 KB Output is partially correct
15 Partially correct 136 ms 256 KB Output is partially correct
16 Partially correct 134 ms 256 KB Output is partially correct
17 Partially correct 68 ms 256 KB Output is partially correct
18 Partially correct 159 ms 288 KB Output is partially correct
19 Partially correct 136 ms 256 KB Output is partially correct
20 Partially correct 167 ms 256 KB Output is partially correct
21 Partially correct 141 ms 256 KB Output is partially correct
22 Partially correct 165 ms 256 KB Output is partially correct
23 Partially correct 135 ms 256 KB Output is partially correct
24 Partially correct 45 ms 384 KB Output is partially correct
25 Partially correct 151 ms 256 KB Output is partially correct
26 Partially correct 126 ms 256 KB Output is partially correct
27 Partially correct 134 ms 256 KB Output is partially correct
28 Partially correct 132 ms 256 KB Output is partially correct
29 Partially correct 83 ms 256 KB Output is partially correct
30 Partially correct 90 ms 256 KB Output is partially correct
31 Partially correct 99 ms 256 KB Output is partially correct
32 Partially correct 83 ms 256 KB Output is partially correct
33 Partially correct 86 ms 256 KB Output is partially correct
34 Partially correct 87 ms 256 KB Output is partially correct
35 Partially correct 95 ms 256 KB Output is partially correct
36 Partially correct 95 ms 256 KB Output is partially correct
37 Partially correct 84 ms 256 KB Output is partially correct
38 Partially correct 89 ms 256 KB Output is partially correct
39 Partially correct 80 ms 256 KB Output is partially correct
40 Partially correct 91 ms 256 KB Output is partially correct
41 Partially correct 89 ms 256 KB Output is partially correct
42 Partially correct 87 ms 256 KB Output is partially correct
43 Partially correct 92 ms 256 KB Output is partially correct
44 Partially correct 87 ms 256 KB Output is partially correct
45 Partially correct 89 ms 256 KB Output is partially correct
46 Partially correct 87 ms 256 KB Output is partially correct
47 Partially correct 91 ms 256 KB Output is partially correct
48 Partially correct 91 ms 256 KB Output is partially correct
49 Partially correct 93 ms 256 KB Output is partially correct
50 Partially correct 87 ms 256 KB Output is partially correct
51 Partially correct 88 ms 256 KB Output is partially correct
52 Partially correct 88 ms 256 KB Output is partially correct
53 Partially correct 94 ms 256 KB Output is partially correct
54 Partially correct 88 ms 256 KB Output is partially correct
55 Partially correct 88 ms 256 KB Output is partially correct
56 Partially correct 92 ms 256 KB Output is partially correct
57 Partially correct 99 ms 256 KB Output is partially correct
58 Partially correct 94 ms 256 KB Output is partially correct
59 Partially correct 92 ms 256 KB Output is partially correct
60 Partially correct 90 ms 256 KB Output is partially correct
61 Partially correct 80 ms 256 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 0 ms 256 KB Output is correct
74 Correct 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 0 ms 256 KB Output is correct
81 Correct 0 ms 256 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 1 ms 256 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct