제출 #121198

#제출 시각아이디문제언어결과실행 시간메모리
121198BTheroTriangles (CEOI18_tri)C++17
컴파일 에러
0 ms0 KiB
// 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.c" #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; }

컴파일 시 표준 에러 (stderr) 메시지

/tmp/ccUM3Xs3.o: In function `get_n':
tri.cpp:(.text+0xf0): multiple definition of `get_n'
/tmp/cccA28w8.o:trilib.c:(.text+0xf0): first defined here
/tmp/ccUM3Xs3.o: In function `is_clockwise':
tri.cpp:(.text+0x120): multiple definition of `is_clockwise'
/tmp/cccA28w8.o:trilib.c:(.text+0x120): first defined here
/tmp/ccUM3Xs3.o: In function `give_answer':
tri.cpp:(.text+0x280): multiple definition of `give_answer'
/tmp/cccA28w8.o:trilib.c:(.text+0x280): first defined here
collect2: error: ld returned 1 exit status