답안 #1062238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062238	2024-08-16T22:27:54 Z	YassirSalama	버섯 세기 (IOI20_mushrooms)	C++17	0 / 100	84 ms	596 KB

mushrooms

#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define mm use_machine
#define pb push_back
int calc(string s,vector<int> v){
	int ans=0;
    for(int i=0;i+1<(int)v.size();i++){
        if(s[v[i]]!=s[v[i+1]]) ans++;
    }
    return ans;
}
map<int,string> mp;
void make(string s){
	if(s.length()==4){
		mp[calc(s,{0,2,1,3})]=s;
		return;
	}
	make(s+'A');
	make(s+'B');

}
int count_mushrooms(int n) {
	int ans=0;
	string s;
	for(int i=0;i<n;i++) s+='?';
	s[0]='A';
	if(mm({0,1})) s[1]='B';
	else s[1]='A';
	if(n==2){
		return 1+s[0]==s[1];
	}
	if(mm({1,2})) s[2]=char(((s[1]-'A')^1)+'A');
	else s[2]=s[1];
	int i=0,j=0;
	for(int a=0;a<=2;a++){
		for(int b=a+1;b<=2;b++){
			if(s[a]==s[b]){
				i=a;
				j=b;
				break;
			}
		}
	}
	string t;
	t+=s[i];t+=s[j];
	make(t);
	for(int k=3;k<n;k+=2){
		if(k+1<n){
			int x=mm({i,k,j,k+1});
			string t = mp[x];
			s[k]=t[2];
			s[k+1]=t[3];
		}else{
			int x=mm({k,k-1});
			if(x){
				s[k]=char(((s[k-1]-'A')^1)+'A');
			}else s[k]=s[k-1];

		}
	}
	for(auto x:s){
		ans+=x=='A';
	}
	return ans;
}

Subtask #1

0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 ms	344 KB	Output is correct
6	Partially correct	5 ms	344 KB	Output is partially correct
7	Partially correct	44 ms	592 KB	Output is partially correct
8	Partially correct	59 ms	488 KB	Output is partially correct
9	Partially correct	50 ms	464 KB	Output is partially correct
10	Partially correct	47 ms	596 KB	Output is partially correct
11	Partially correct	52 ms	464 KB	Output is partially correct
12	Partially correct	54 ms	468 KB	Output is partially correct
13	Partially correct	63 ms	464 KB	Output is partially correct
14	Partially correct	22 ms	344 KB	Output is partially correct
15	Partially correct	67 ms	472 KB	Output is partially correct
16	Partially correct	53 ms	592 KB	Output is partially correct
17	Partially correct	25 ms	344 KB	Output is partially correct
18	Partially correct	57 ms	344 KB	Output is partially correct
19	Partially correct	56 ms	464 KB	Output is partially correct
20	Partially correct	56 ms	592 KB	Output is partially correct
21	Partially correct	57 ms	596 KB	Output is partially correct
22	Partially correct	49 ms	468 KB	Output is partially correct
23	Partially correct	82 ms	468 KB	Output is partially correct
24	Partially correct	27 ms	344 KB	Output is partially correct
25	Partially correct	54 ms	468 KB	Output is partially correct
26	Partially correct	60 ms	468 KB	Output is partially correct
27	Partially correct	58 ms	468 KB	Output is partially correct
28	Partially correct	53 ms	340 KB	Output is partially correct
29	Partially correct	50 ms	468 KB	Output is partially correct
30	Partially correct	62 ms	468 KB	Output is partially correct
31	Partially correct	52 ms	592 KB	Output is partially correct
32	Partially correct	67 ms	592 KB	Output is partially correct
33	Partially correct	57 ms	468 KB	Output is partially correct
34	Partially correct	59 ms	480 KB	Output is partially correct
35	Partially correct	48 ms	344 KB	Output is partially correct
36	Partially correct	57 ms	472 KB	Output is partially correct
37	Partially correct	61 ms	592 KB	Output is partially correct
38	Partially correct	54 ms	464 KB	Output is partially correct
39	Partially correct	63 ms	468 KB	Output is partially correct
40	Partially correct	70 ms	464 KB	Output is partially correct
41	Partially correct	57 ms	464 KB	Output is partially correct
42	Partially correct	84 ms	472 KB	Output is partially correct
43	Partially correct	68 ms	592 KB	Output is partially correct
44	Partially correct	49 ms	464 KB	Output is partially correct
45	Partially correct	69 ms	344 KB	Output is partially correct
46	Partially correct	46 ms	464 KB	Output is partially correct
47	Partially correct	53 ms	472 KB	Output is partially correct
48	Partially correct	67 ms	464 KB	Output is partially correct
49	Partially correct	60 ms	468 KB	Output is partially correct
50	Partially correct	45 ms	592 KB	Output is partially correct
51	Partially correct	55 ms	468 KB	Output is partially correct
52	Partially correct	65 ms	468 KB	Output is partially correct
53	Partially correct	61 ms	468 KB	Output is partially correct
54	Partially correct	61 ms	468 KB	Output is partially correct
55	Partially correct	58 ms	344 KB	Output is partially correct
56	Partially correct	62 ms	468 KB	Output is partially correct
57	Partially correct	49 ms	468 KB	Output is partially correct
58	Partially correct	56 ms	592 KB	Output is partially correct
59	Partially correct	44 ms	464 KB	Output is partially correct
60	Partially correct	46 ms	344 KB	Output is partially correct
61	Partially correct	61 ms	464 KB	Output is partially correct
62	Incorrect	0 ms	344 KB	Answer is not correct.
63	Halted	0 ms	0 KB	-