제출 #993911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993911		Lib	9월 (APIO24_september)	C++17	100 / 100	121 ms	13520 KiB

september

#include <bits/stdc++.h>
//#include "september.h"
using namespace std;
int xorhash[10];
vector <set <int> > ShitPar;
set <int> TSet;
int RemChild[10][500003];
int solve(int n, int m, vector<int> Par, vector <vector<int> > Record){
	int ans;
	ans=0;
	for(int i=0;i<n;i++){
		for(int k=0;k<m;k++){
		RemChild[k][i]=0;
		}
	}
	for(int i=0;i<n-1;i++){
		for(int k=0;k<m;k++){
			RemChild[k][Par[Record[k][i]]]++;
		}
	}
	ShitPar.clear();
	TSet.clear();
	for(int i=0;i<m;i++){
		xorhash[i]=123456789;	
		ShitPar.push_back(TSet);
	}
	for(int k=0;k<m;k++){
		for(int i=0;i<n;i++){
		//	cout<<RemChild[k][i]<<" ";
		}
	//	cout<<"\n";
	}
	int check1,check2;
	ans=0;
	for(int i=0;i<n-1;i++){
		for(int k=0;k<m;k++){
			xorhash[k]^=Record[k][i];
			RemChild[k][Par[Record[k][i]]]--;
			if(!RemChild[k][Par[Record[k][i]]]){
				ShitPar[k].erase(Par[Record[k][i]]);
			}
			if(RemChild[k][Record[k][i]]){
				ShitPar[k].insert(Record[k][i]);
			}
		}
		xorhash[m]=xorhash[m-1];
		check1=0;
		check2=0;
		for(int k=0;k<m;k++){
			check1|=(!ShitPar[k].empty());
			check2|=(xorhash[k]!=xorhash[k+1]);
			//cout<<check1<<" "<<check2<<"\n";
		}
		if(!check1&&!check2){
			ans++;
		}
	}
	Record.clear();
	Par.clear();
	return ans;
}
/*
int main(){
	for(int i=1;i<=5;i++){
		cout<<solve(7, 1, {-1, 0, 0, 2, 3,3,5}, {{1,6,4,3,5,2}});
	//cout<<solve(7, 2, {-1,0,1,2,3,4,5}, {{1,2,3,4,5,6},{1,2,6,5,4,3}});
	//cout<<solve(3, 5, {-1, 0, 0}, {{1, 2},{1,2},{1,2},{1,2},{1,2}});
	//cout<<solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {2,1,3,4}});
	//cout<<solve(7, 1, {-1,0,1,2,3,4,5}, {{2,4,3,5,1,6}});
	cout<<"\n";
	}
}
*/
/*
post ac comments
dit me cuoc doi thieu nang tri tue suc sinh vo hoc chet nao iq 30(do F) ngu lon singlehandedly giam ti le AC tu 1/2 xuong 1/3
i should kms
*/

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 11 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16