oj.uz

답안 #670935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670935 2022-12-11T11:42:48 Z Dan4Life Palembang Bridges (APIO15_bridge) C++17
0 / 100
 2 ms 368 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
using ll = long long;
using pii = pair<int,int>;
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = (int)1e5+10;
const ll LINF = (ll)1e18;
vector<int> v;
vector<pii> segments;
deque<pii> bef,dur,aft;
int t, n, sum_bef, sum_dur, sum_aft;
int32_t main() {
	cin >> t >> n; int tot = 0, sum = 0, ans=LINF;
	for(int i = 0; i < n; i++){
		char a, c; int b, d;
		cin >> a >> b >> c >> d;
		if(a==c) tot+=abs(b-d);
		else{
			if(b>d) swap(b,d); tot++;
			segments.pb({b,d});
			v.pb(b), v.pb(d);
		}
	}
	v.pb(0), v.pb(1000000000);
	sort(all(v));sort(all(segments));
	v.erase(unique(all(v)), v.end());
	for(auto u : segments) aft.pb(u), sum_aft+=u.fi+u.se;

	for(auto u : v){
		while(!aft.empty() and aft[0].fi<=u){
			dur.pb(aft[0]); 
			sum_dur+=aft[0].se-aft[0].fi;
			sum_aft-=aft[0].fi+aft[0].se;
			aft.pop_front();
		}

		while(!dur.empty() and dur[0].se<u){
			bef.pb(dur[0]);
			sum_bef+=-dur[0].se-dur[0].fi;
			sum_dur-=dur[0].se-dur[0].se;
			dur.pop_front();
		}

		ans = min(ans, (sz(bef)-sz(aft))*2*u+sum_bef+sum_dur+sum_aft);
	}
	cout << ans+tot;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:24:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   24 |    if(b>d) swap(b,d); tot++;
      |    ^~
bridge.cpp:24:23: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   24 |    if(b>d) swap(b,d); tot++;
      |                       ^~~
bridge.cpp:18:30: warning: unused variable 'sum' [-Wunused-variable]
   18 |  cin >> t >> n; int tot = 0, sum = 0, ans=LINF;
      |                              ^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Incorrect 2 ms 368 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 2 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -