제출 #993905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993905		Lib	9월 (APIO24_september)	C++17	0 / 100	1 ms	10584 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;
	ans=0;
	for(int i=0;i<n;i++){
		for(int k=0;k<5;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<8;i++){
		xorhash[i]=123456789;	
		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|=(!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<=10;i++){
	//	cout<<solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}});
	//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, 2, {-1, 0, 0}, {{1, 2},{2,1}});
	cout<<solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {2,1,3,4}});
	cout<<"\n";
	}
}
*/

컴파일 시 표준 에러 (stderr) 메시지

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:24:13: warning: iteration 6 invokes undefined behavior [-Waggressive-loop-optimizations]
   24 |   xorhash[i]=123456789;
      |   ~~~~~~~~~~^~~~~~~~~~
september.cpp:23:15: note: within this loop
   23 |  for(int i=0;i<8;i++){
      |              ~^~

• 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