Submission #917965

#TimeUsernameProblemLanguageResultExecution timeMemory
917965PM1Triangles (CEOI18_tri)C++17
0 / 100
3063 ms516 KiB
#include <bits/stdc++.h>
#include "trilib.h"
using namespace std;
const int mxn=500+5;
int n,mark[mxn],ans=3,nxt[mxn],pre[mxn],st=1;
void merge(int x,int y){
	pre[y]=x;
	nxt[x]=y;
}
int main(){
	n=get_n();
	if(is_clockwise(1,2,3)){
		merge(1,2);
		merge(2,3);
		merge(3,1);
	}
	else{
		merge(2,1);
		merge(3 ,2);
		merge(1,3);
	}
	for(int i=4;i<=n;i++){
		while(!mark[st]){
			mark[st]=1;
			if(is_clockwise(st,nxt[st],i)){
				st=nxt[st];
				continue;
			}
			ans++;
			merge(i,nxt[st]);
			merge(st,i);
			while(!is_clockwise(i,nxt[i],nxt[nxt[i]])){
				ans--;
				merge(i,nxt[nxt[i]]);
			}
			while(!is_clockwise(pre[st],st,i)){
				ans--;
				merge(pre[st],i);
			}
		}
		memset(mark,0,sizeof mark);
	}
	give_answer(ans);
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...