제출 #1074901

#제출 시각아이디문제언어결과실행 시간메모리
1074901steveonalex마상시합 토너먼트 (IOI12_tournament)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() #define block_of_code if(true) ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll gcd(ll a, ll b){return __gcd(a, b);} ll lcm(ll a, ll b){return a / gcd(a, b) * b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} double rngesus_d(double l, double r){ double cur = rngesus(0, MASK(60) - 1); cur /= MASK(60) - 1; return l + cur * (r - l); } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: container) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } struct FenwickTree{ int n; vector<int> a; FenwickTree(int _n){ n = _n; a.resize(n+1); } void update(int i, int v){ while(i <= n){ a[i] += v; i += LASTBIT(i); } } int get(int i){ int ans = 0; while(i > 0){ ans += a[i]; i -= LASTBIT(i); } return ans; } int find(int v){ int p = MASK(logOf(n)), sum = 0, idx= 0; while(p){ if (idx + p <= n && a[idx + p] + sum < v){ idx += p; sum += a[idx]; } p >>= 1; } return idx + 1; } }; struct SegmentTree{ int n; vector<int> a; SegmentTree(int _n){ n = _n; a.resize(n * 2 + 2, -1); } void update(int i, int v){ i += n; if (!maximize(a[i], v)) return; while(i > 1){ i >>= 1; a[i] = max(a[i * 2], a[i * 2 + 1]); } } int get(int l, int r){ l += n; r += n + 1; int ans = -1; while(l < r){ if (l & 1) maximize(ans, a[l++]); if (r & 1) maximize(ans, a[--r]); l >>= 1; r >>= 1; } return ans; } }; int GetBestPosition(int n, int c, int r, int *K, int *S, int *E) { vector<int> graph(n+c+1, -1); vector<int> cur(n+1); for(int i = 1; i<=n; ++i) cur[i] = i; FenwickTree bit(n); for(int i = 1; i<=n; ++i) bit.update(i, 1); for(int i = 0; i<c; ++i){ int l = S[i] + 1, r = E[i] + 1; vector<int> pos; for(int j = l; j <= r; ++j) pos.push_back(bit.find(j)); for(int j: pos) { graph[cur[j]] = n + i + 1; if (j != pos[0]) bit.update(j, -1); else cur[j] = n + i + 1; } } vector<pair<int, int>> range(n+c+1, {1e9, 0}); vector<int> ma(n+c+1); SegmentTree st(n-1); for(int i = 1; i<n; ++i) st.update(i, K[i-1]); for(int i = 1; i<=n+c; ++i) { if (i <= n){ range[i] = {i, i}; } if (graph[i] != -1){ int j = graph[i]; maximize(range[j].second, range[i].second); minimize(range[j].first, range[i].first); } ma[i] = st.get(range[i].first, range[i].second - 1); } vector<int> dp(n+c+1); for(int i = n+c; i>=1; --i){ if (graph[i] != -1){ if (ma[graph[i]] < r) maximize(dp[i], dp[graph[i]] + 1); } } int ans = max_element(ALL(dp)) - dp.begin() - 1; maximize(ans, 0); return ans; } int main(void){ ios::sync_with_stdio(0);cin.tie(0); cout.tie(0); clock_t start = clock(); int n, c, r; cin >> n >> c >> r; int k[n-1], s[c], e[c]; for(int i = 0; i<n-1; ++i) cin >> k[i]; for(int i= 0; i<c; ++i) cin >> s[i] >> e[i]; cout << GetBestPosition(n, c, r, k, s, e) << "\n"; cerr << "Time elapsed: " << clock() - start << " ms\n"; return 0; }

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

/usr/bin/ld: /tmp/ccIQDcUM.o: in function `main':
tournament.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccnJpm6N.o:grader.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status