제출 #236398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236398		super_j6	Triangles (CEOI18_tri)	C++14	0 / 100	5 ms	384 KiB

tri

#include "trilib.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

int n;
vector<int> a[2];
vector<int> v;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	n = get_n();
	
	a[0] = {1, 2};
	for(int i = 3; i <= n; i++){
		a[is_clockwise(1, 2, i)].push_back(i);
	}
	
	for(int t = 0; t < 2; t++){
		sort(a[t].begin() + !t, a[t].end(), [&](int x, int y){
			return is_clockwise(1, x, y);	
		});
		
		for(int i : a[t]) cout << i << " ";
		cout << endl;
	}

	return 0;
}

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