# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
882612 | 2023-12-03T12:15:56 Z | vjudge1 | Palembang Bridges (APIO15_bridge) | C++17 | 1 ms | 600 KB |
#include <bits/stdc++.h> using namespace std; #define n_l '\n' #define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } #define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl #define int long long int #define MP make_pair #define pb push_back #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++) void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const double EPS = 0.00001; const int INF = 1e9+500; const int N = 1e5+5; const int ALPH = 26; const int LGN = 25; const int MOD = 1e9+7; int n,m,q,K; struct Interval { int l,r; Interval(int left, int right) { l = left; r = right; } Interval() { l = 0; r = 0; } void print() { cout<<"l:"<<l<<" r:"<<r<<"\n"; } }; bool compByL(const Interval &x, const Interval &y) { if(x.l == y.l) return x.r < y.r; return x.l < y.l; } bool compByR(const Interval &x, const Interval &y) { if(x.r == y.r) return x.l < y.l; return x.r < y.r; } vector<Interval> lsort, rsort; int lcost[N]; int lsuf[N]; inline void solve() { cin>>K>>n; int ans = 0; for(int i = 0; i<n; i++) { int b,d; char a,c; cin>>a>>b>>c>>d; ans += abs(b - d); if(a != c) { if(b > d) swap(b,d); lsort.pb(Interval(b,d)); rsort.pb(Interval(b,d)); } } n = lsort.size(); ans += n; if(n == 0) { cout<<ans<<"\n"; return; } sort(lsort.begin(), lsort.end(), compByL); sort(rsort.begin(), rsort.end(), compByR); lsuf[n - 1] = lsort[n - 1].l; for(int i = n - 2; i>=0; i--) { lsuf[i] = lsuf[i + 1] + lsort[i].l; } lsuf[n] = 0; lcost[0] = 0; int res = INF; auto itr = upper_bound(lsort.begin(), lsort.end(), Interval(rsort[0].r, INF), compByL); // find first great l ind int ind = itr - lsort.begin(); res = min(res , lcost[0] + lsuf[ind] - rsort[0].r * (n - ind)); // rsort[0].print(); for(int i = 1; i<n; i++) { lcost[i] = lcost[i - 1] + (rsort[i].r - rsort[i - 1].r) * i; // rsort[i].print(); // dbg(i); // dbg(lcost[i]); // one bridge auto itr = upper_bound(lsort.begin(), lsort.end(), Interval(rsort[0].r, INF), compByL); // find first great l ind int ind = itr - lsort.begin(); res = min(res , lcost[i] + lsuf[ind] - rsort[i].r * (n - ind)); // dbg(lcost[i] + lsuf[ind] - rsort[i].r * (n - ind)); // dbg(ind); // dbg(res); } // dbg(res); cout<<res * 2ll + ans<<"\n"; } signed main() { //fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 600 KB | Output is correct |
4 | Incorrect | 1 ms | 492 KB | Output isn't correct |
5 | 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 | 1 ms | 348 KB | Output is correct |
4 | Incorrect | 1 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 436 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 | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 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 | - |