Submission #232782

#	Time	Username	Problem	Language	Result	Execution time	Memory
232782		dolphingarlic	Triangles (CEOI18_tri)	C++14	0 / 100	5 ms	640 KiB

tri

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <trilib.h>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

const int maxn = 50;
int n;
bool works[maxn];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	n = get_n();
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(i == j) continue;
			bool t = 1;
			for(int k = 0; k < n; k++){
				if(k == i || k == j) continue;
				t &= is_clockwise(i, j, k);
			}
			works[i] |= t;
			works[j] |= t;
		}
	}
	
	int ret = 0;
	for(int i = 0; i < n; i++) ret += works[i];
	give_answer(ret);

	return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25