Submission #136043

#	Time	Username	Problem	Language	Result	Execution time	Memory
136043		Minnakhmetov	Triangles (CEOI18_tri)	C++14	75 / 100	1311 ms	4364 KiB

tri

#include<bits/stdc++.h>
#include "trilib.h"
using namespace std;
 
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

int ct = 0;

bool is_clockwise2(int a, int b, int c) {
    ct++;
    if (ct > 1000000)
        exit(1);
    return is_clockwise(a, b, c);
}
vector<int> build_hull(vector<int> v, bool inv) {
    sort(v.begin() + 1, v.end(), [=](int x, int y) {
        return is_clockwise2(v[0], x, y) ^ inv;
    });
    vector<int> h;
    for (int x : v) {
        while (h.size() > 1 && !(is_clockwise2(*(h.end() - 2), *(h.end() - 1), x) ^ inv)) {
            h.pop_back();
        }
        h.push_back(x);
    }
    return h;
}

vector<int> just_sort(vector<int> v, bool inv) {
    sort(v.begin() + 1, v.end(), [=](int x, int y) {
        return is_clockwise2(v[0], x, y) ^ inv;
    });
    return v;
}
 
const int N = 1e5;
bool ban[N];
 
signed main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int n = get_n();
 
    vector<int> v1 = { 1 }, v2 = { 1 };
 
    for (int i = 3; i <= n; i++) {
        if (is_clockwise2(1, 2, i)) {
            v2.push_back(i);
        }
        else {
            v1.push_back(i);
        }
    }
 
    v1.push_back(2);
    v2.push_back(2);
 
    v1 = build_hull(v1, 0);
    v2 = just_sort(v2, 1);
 
    v2.erase(v2.begin());
    v2.pop_back();
 
    reverse(all(v1));
 
    for (int x : v2) {
        while (v1.size() > 1 && is_clockwise2(*(v1.end() - 2), *(v1.end() - 1), x)) {
            ban[v1.back()] = 1;
            v1.pop_back();
        }
        v1.push_back(x);
    }
 
    reverse(all(v1));
    reverse(all(v2));
 
    for (int x : v2) {
        if (ban[x])
            continue;
        while (v1.size() > 1 && !is_clockwise2(*(v1.end() - 2), *(v1.end() - 1), x)) {
            ban[v1.back()] = 1;
            v1.pop_back();
        }
        v1.push_back(x);
    }


    sort(all(v1));
    v1.erase(unique(all(v1)), v1.end());
 
    int ans = 0;
    for (int i : v1) {
        if (!ban[i])
            ans++;
    }
 
    cout << ans;
 
 
    return 0;
}

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