제출 #993894

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

september

#include <bits/stdc++.h>
#include "september.h"
using namespace std;
long long xorhash[6];
vector <set <int> > ShitPar;
set <int> TSet;
long long RemChild[10][500003];
int solve(int n, int m, vector<int> Par, vector <vector<int> > Record){
	int ans=0;
	for(int i=0;i<n;i++){
		for(int k=0;k<5;k++){
		RemChild[k][i]=0;
		}
	}
	for(int i=1;i<n;i++){
		for(int k=0;k<m;k++){
			RemChild[k][Par[Record[k][i]]]++;
		}
	}
	ShitPar.clear();
	for(int i=0;i<5;i++){
		xorhash[i]=463222221001217544;	
		ShitPar.push_back(TSet);
	}
	int check1,check2;
	for(int i=n-2;i>=0;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|=int(ShitPar[k].size());
			check2|=(xorhash[k]!=xorhash[k+1]);
			//cout<<check1<<" "<<check2<<"\n";
		}
		if(!check1&&!check2){
			ans++;
		}
	}
	return ans;
}
/*
int main(){
	cout<<solve(3, 1, {-1, 0, 0}, {{1, 2}});
}
*/

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