제출 #121199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
121199		BThero	Triangles (CEOI18_tri)	C++17	35 / 100	788 ms	512 KiB

tri

// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include"trilib.h"

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)4e4 + 5;

int pivot;

bool cmp(int a, int b) {
    return is_clockwise(pivot, a, b);    
}

void printVec(vector<int> V) {
    printf("Hull is:");

    for (int x : V) {
        printf(" %d", x);
    }

    printf("\n");
}

void solve() {
    int n = get_n();
    int ans = n;        

    for (int i = 1; i <= n; ++i) {
        bool good = 0;

        for (int j = 1; j <= n; ++j) {
            if (i == j) {
                continue;
            }

            bool found = 0;

            for (int k = 1; k <= n; ++k) {
                if (k != i && k != j) {
                    if (is_clockwise(i, j, k)) {
                        found = 1;
                    }
                }                
            }

            good |= (!found);
        }

        if (!good) {
            --ans;
        }
    }

    give_answer(ans);
}

int main() {
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

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