# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484978 | M4mou | Counting Mushrooms (IOI20_mushrooms) | C++17 | 9 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "mushrooms.h"
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define all(x) (x).begin() , (x).end()
string s;/*
int use_machine(vector<int> a){
int c = 0;
for(int i = 1;i<a.size();i++){
if(s[a[i]] != s[a[i-1]])c++;
}
return c;
}*/
int count_mushrooms(int n) {
int cnt = 1;
if(n < 226){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |