제출 #229268

#제출 시각아이디문제언어결과실행 시간메모리
229268rqiPalembang Bridges (APIO15_bridge)C++14
100 / 100
536 ms40764 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef string str; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef pair<db,db> pd; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<db> vd; typedef vector<str> vs; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<pd> vpd; #define mp make_pair #define f first #define s second #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) (x).rbegin(), (x).rend() #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const int MX = 2e5+5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } int pct(int x) { return __builtin_popcount(x); } int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 // INPUT template<class A> void re(complex<A>& c); template<class A, class B> void re(pair<A,B>& p); template<class A> void re(vector<A>& v); template<class A, size_t SZ> void re(array<A,SZ>& a); template<class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); } template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; } template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); } template<class A> void re(vector<A>& x) { trav(a,x) re(a); } template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); } // TO_STRING #define ts to_string template<class A, class B> str ts(pair<A,B> p); template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); } str ts(bool b) { return b ? "true" : "false"; } str ts(char c) { str s = ""; s += c; return s; } str ts(str s) { return s; } str ts(const char* s) { return (str)s; } str ts(vector<bool> v) { bool fst = 1; str res = "{"; F0R(i,sz(v)) { if (!fst) res += ", "; fst = 0; res += ts(v[i]); } res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } template<class T> str ts(T v) { bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; } template<class A, class B> str ts(pair<A,B> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; } // OUTPUT template<class A> void pr(A x) { cout << ts(x); } template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); } void ps() { pr("\n"); } // print w/ spaces template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); } // DEBUG void DBG() { cerr << "]" << endl; } template<class H, class... T> void DBG(H h, T... t) { cerr << to_string(h); if (sizeof...(t)) cerr << ", "; DBG(t...); } #ifdef LOCAL // compile with -DLOCAL #define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #else #define dbg(...) 42 #endif // FILE I/O void setIn(string s) { freopen(s.c_str(),"r",stdin); } void setOut(string s) { freopen(s.c_str(),"w",stdout); } void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); } void setIO(string s = "") { unsyncIO(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO } mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); const int mx = 100005; char P[mx]; ll S[mx]; char Q[mx]; ll T[mx]; int K, N; vl getA(vpl houses){ if(N == 0) return {}; vl poses; vector<pair<ll, int>> sums; for(int i = 0; i < N; i++){ sums.pb(mp(houses[i].f+houses[i].s, i)); } for(int i = 0; i < N; i++){ poses.pb(houses[i].f); poses.pb(houses[i].s); } sort(all(poses)); poses.resize(distance(poses.begin(), unique(all(poses)))); vector<vl> at; map<ll, int> m; for(int i = 0; i < sz(poses); i++){ at.pb({}); m[poses[i]] = i; } for(int i = 0; i < N; i++){ int ind = sums[i].s; at[m[houses[ind].f]].pb(i); at[m[houses[ind].s]].pb(i); } //dbg(poses); //dbg(at); vl ans(N, INF); ans[0] = 0; int curposind = 0; ll diff = 0; /*for(int i = 0; i < N; i++){ dbg(i, houses[i], sums[i]); }*/ for(int i = 0; i < N; i++){ //get ans[i] int ind = sums[i].s; if(i >= 1) ans[i] = ans[i-1]; //constant addition ans[i]+=1+abs(houses[ind].f-poses[curposind])+abs(houses[ind].s-poses[curposind]); //derivative addition if(houses[ind].f <= poses[curposind]) diff++; else diff--; if(houses[ind].s <= poses[curposind]) diff++; else diff--; while(curposind+1 < sz(poses)){ //see if increasing pos helps, if so, do it. if(diff > 0) break; ans[i]+=(poses[curposind+1]-poses[curposind])*(diff); //change diff for(auto u: at[curposind+1]){ if(u <= i){ diff+=2; } } //dbg(i, curposind+1, diff); curposind++; } } return ans; } int main() { setIO(); cin >> K >> N; for(int i = 1; i <= N; i++){ cin >> P[i] >> S[i] >> Q[i] >> T[i]; } ll ezans = 0; vpl houses; for(int i = 1; i <= N; i++){ if(P[i] == Q[i]){ ezans+=abs(T[i]-S[i]); } else{ if(S[i] > T[i]) swap(S[i], T[i]); houses.pb(mp(S[i], T[i])); } } sort(all(houses)); N = sz(houses); if(K == 1){ ll ans = INF; ll curpos = 0; ll curans = 0; for(int i = 0; i < N; i++){ curans+=1+houses[i].f+houses[i].s; } ll pdiff = -2*N; //(number of houses left - number of pairs right) vector<pair<ll, bool>> events; for(int i = 0; i < N; i++){ events.pb(mp(houses[i].f, 0)); events.pb(mp(houses[i].s, 1)); } sort(all(events)); for(auto u: events){ curans+=pdiff*(u.f-curpos); ckmin(ans, curans); pdiff+=2; curpos = u.f; } if(sz(houses) == 0) ans = 0; ps(ans+ezans); return 0; } else{ vector<pair<ll, pl>> ihouse; for(auto u: houses){ ihouse.pb(mp(u.f+u.s, u)); } sort(all(ihouse)); vpl h; for(auto u: ihouse){ h.pb(u.s); } vl a = getA(h); reverse(all(h)); for(int i = 0; i < sz(h); i++){ ll a = h[i].f; h[i].f = -h[i].s; h[i].s = -a; } vl b = getA(h); //dbg(a, b); ll ans = INF; for(int i = 0; i <= N-2; i++){ ckmin(ans, a[i]+b[N-2-i]); } if(N == 1){ ans = 1+abs(houses[0].f-houses[0].s); } if(N == 0){ ans = 0; } ps(ans+ezans); return 0; } // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN */

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

bridge.cpp: In function 'void setIn(std::__cxx11::string)':
bridge.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bridge.cpp: In function 'void setOut(std::__cxx11::string)':
bridge.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...