제출 #425247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425247		Blistering_Barnacles	Triangles (CEOI18_tri)	C++11	35 / 100	430 ms	13384 KiB

tri

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include "trilib.h"
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , set < ll > > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll v ;
void solve(){
    set < ll > se ;
    n = get_n() ;
    for(ll i = 1 ; i <= n ; i++){
        for(ll j = i + 1 ; j <= n ; j++){
            ll op = 0 ;
            for(ll i1 = 1 ; i1 <= n;  i1++){
                if(i1 == i || i1 == j)C ;
                op |= (1 << is_clockwise(i , j , i1)) ;
            }
            if(op < 3)se.insert(i) , se.insert(j) ;
        }
    }
    give_answer(sz(se)) ;
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

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