# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
887930 | 2023-12-15T13:57:21 Z | Kutan | Palembang Bridges (APIO15_bridge) | C++14 | 6 ms | 468 KB |
// Cao Quang Hung #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> using namespace std; #define pb push_back #define eb emplace_back #define mp make_pair #define pii pair<int,int> #define pll pair<long long , long long> #define vi vector<int> #define vpii vector<pii> #define SZ(x) ((int)(x.size())) #define fi first #define se second #define IN(x,y) ((y).find((x))!=(y).end()) #define ALL(t) t.begin(),t.end() #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i) #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i) #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i)) #define dem(x) __builtin_popcount(x) #define Mask(x) (1LL << (x)) #define BIT(x, i) ((x) >> (i) & 1) #define ln '\n' #define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); ///mt19937 rnd(time(0)); const int INF = 1e9 , mod = 1e9 + 7; template <class T1, class T2> inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; } template <class T1 , class T2> inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;} template <class T> inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; } template <class T> inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; } template <class T> inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; } template <class T> inline T product (const T &x , const T &y) { return 1LL * x * y % mod; } #define PROB "a" void file(){ if(fopen(PROB".inp", "r")){ freopen(PROB".inp","r",stdin); freopen(PROB".out","w",stdout); } } void sinh_(){ // srand(time(0)); // freopen(PROB".inp" , "w" , stdout); // int n; } typedef long long ll; typedef double db; const int N = 2e5 + 5; int k, n; ll Ans = 0; pii segment[N]; int numseg = 0, numpoint; vector<int> compress; void readip(){ cin >> k >> n; REP(i, 1, n) { char a, b; int l, r; cin >> a >> l >> b >> r; Ans += abs(r - l); if (a == b) continue; ++Ans; if (l > r) swap(l, r); segment[++numseg] = {l, r}; compress.eb(l); compress.eb(r); } sort(ALL(compress)); compress.erase(unique(ALL(compress)), compress.end()); numpoint = compress.size(); if (numpoint == 0) { cout << Ans << ln; exit(false); } sort(segment + 1, segment + numseg + 1); REP(i, 1, numseg) { // cout << segment[i].fi << ' ' << segment[i].second << ln; segment[i].first = lower_bound(ALL(compress), segment[i].first) - compress.begin() + 1; segment[i].second = lower_bound(ALL(compress), segment[i].second) - compress.begin() + 1; } } namespace sub1 { bool check() { return k == 1; } vector<pair<ll, int>> pref, suf; void solve() { pref.assign(numpoint + 2, {0, 0}); suf.assign(numpoint + 2, {0, 0}); REP(i, 1, numseg) { pref[segment[i].second].first += compress[segment[i].second - 1]; pref[segment[i].second].second++; suf[segment[i].first].first += compress[segment[i].first - 1]; suf[segment[i].first].second++; } REP(i, 1, numpoint) { pref[i].first += pref[i - 1].first; pref[i].second += pref[i - 1].second; } REPD(i, numpoint - 1, 1) { suf[i].first += suf[i + 1].first; suf[i].second += suf[i + 1].second; } ll res = 1e18; REP(i, 1, numpoint) { int x = compress[i - 1]; ll tmp = 1LL * x * pref[i].second - pref[i].first + suf[i].first - 1LL * x * suf[i].second; tmp *= 2; minimize(res, tmp); } cout << Ans + res << ln; } }; namespace sub2 { void solve() { ll res = 1e18; REP(i, 1, numpoint) REP(j, i + 1, numpoint) { ll sum = 0; REP(s, 1, numseg) { if (segment[s].first > i && segment[s].se < j) sum += min(compress[segment[s].first - 1] - compress[i - 1] , compress[j - 1] - compress[segment[s].se - 1]); else if (segment[s].second <= i) sum += compress[i - 1] - compress[segment[s].second - 1]; else if (segment[s].first >= j) sum += compress[segment[s].first - 1] - compress[j - 1]; } minimize(res, sum); } cout << Ans + res * 2 << ln; } }; namespace sub3 { vector<int> cnt; void ins(int x) { REPD(i, x - 1, 1) ++cnt[i]; } void del(int x) { REPD(i, x - 1, 1) --cnt[i]; } void solve() { cnt.assign(numpoint + 2, 0); REP(i, 1, numseg) Ans -= compress[segment[i].se - 1] - compress[segment[i].fi - 1]; sort(segment + 1, segment + numseg + 1, [&] (const pii &x, const pii &y) { return compress[x.fi - 1] + compress[x.se - 1] < compress[y.fi - 1] + compress[y.se - 1]; }); // REP(i, 1, numseg) cout << compress[segment[i].fi - 1] << ' ' << compress[segment[i].se - 1] << ln; // cout << ln; ll res = 1e18; REP(lid, 1, numpoint - 1) { REP(i, 1, numpoint) cnt[i] = 0; int L = compress[lid - 1]; int R = compress[lid]; int sum = L + R; int pt = 1, num = 0; ll S = 0; while(pt <= numseg && compress[segment[pt].fi - 1] + compress[segment[pt].se - 1] <= sum) { S += abs(compress[segment[pt].fi - 1] - L); S += abs(compress[segment[pt].se - 1] - L); ++pt; } REP(i, pt, numseg) { S += abs(compress[segment[i].fi - 1] - R); S += abs(compress[segment[i].se - 1] - R); ins(segment[i].fi); ins(segment[i].se); num += 2; } minimize(res, S); REP(rid, lid + 2, numpoint) { assert(R == compress[rid - 2]); int tmp = cnt[rid - 1]; S -= tmp; S += (num - tmp); sum = L + compress[rid - 1]; while(pt <= numseg && compress[segment[pt].fi - 1] + compress[segment[pt].se - 1] <= sum) { S -= abs(compress[segment[pt].fi - 1] - R); S += abs(compress[segment[pt].fi - 1] - L); S -= abs(compress[segment[pt].se - 1] - R); S += abs(compress[segment[pt].se - 1] - L); del(segment[pt].fi); del(segment[pt].se); num -= 2; ++pt; } minimize(res, S); R = compress[rid - 1]; } } // if (res == 1e18) res = 0; cout << Ans + res << ln; } }; void solve(){ // if (sub1::check()) { // sub1::solve(); // return; // } if (numpoint <= 2) { cout << Ans << ln; return; } if (n <= 100) { sub2::solve(); return; } if (n <= 1000) { sub3::solve(); return; } } int main(){ sinh_(); io_faster file(); int t = 1; // cin >> t; while (t--){ readip(); solve(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 3 ms | 468 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 3 ms | 348 KB | Output is correct |
9 | Correct | 3 ms | 460 KB | Output is correct |
10 | Correct | 3 ms | 468 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 4 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 3 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 4 ms | 348 KB | Output is correct |
9 | Correct | 3 ms | 344 KB | Output is correct |
10 | Correct | 3 ms | 468 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 3 ms | 348 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Incorrect | 6 ms | 348 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 3 ms | 468 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 4 ms | 348 KB | Output is correct |
9 | Correct | 4 ms | 460 KB | Output is correct |
10 | Correct | 4 ms | 344 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 4 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Incorrect | 6 ms | 348 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |