oj.uz

답안 #349369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349369 2021-01-17T13:10:29 Z AmineWeslati Palembang Bridges (APIO15_bridge) C++14
100 / 100
 109 ms 8804 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int K,N;
vpi vec;
vi pref(MX,0);

bool cmp(pi a, pi b){
	return a.fi+a.se<b.fi+b.se;
}

int l,r;
priority_queue<int> lpq;
priority_queue<int,vi,greater<int>> rpq;

void add(int x){
	int med=(sz(lpq)?lpq.top():INF);
	if(x<=med){
		lpq.push(x);
		l+=x;
	}
	else{
		rpq.push(x);
		r+=x;
	}

	if(sz(lpq)>sz(rpq)+1){
		int cur=lpq.top();
		lpq.pop();
		rpq.push(cur);
		l-=cur;
		r+=cur;
	}
	else if(sz(lpq)<sz(rpq)){
		int cur=rpq.top();
		rpq.pop();
		lpq.push(cur);
		r-=cur;
		l+=cur;
	}
}

int32_t main() {
    boost; IO();

    cin>>K>>N;

    int ans,same=0;
    vec.eb(0,0);
    FOR(i,0,N){
    	char a,b; int x,y; cin>>a>>x>>b>>y;
    	if(a==b) same+=abs(x-y);
    	else vec.eb(x,y);
    }
    sort(all(vec),cmp);

    N=sz(vec)-1; same+=N;
    r=l=0;
    FOR(i,1,N+1){
    	add(vec[i].fi);
    	add(vec[i].se);
    	pref[i]=r-l;
    }

    ans=pref[N];
    if(K==2){
    	while(sz(lpq)) lpq.pop();
    	while(sz(rpq)) rpq.pop();
    	l=r=0;

    	ROF(i,1,N+1){
    		add(vec[i].fi);
    		add(vec[i].se);
    		ckmin(ans,r-l+pref[i-1]);
    	}
    }
    ans+=same;
    cout << ans << endl;
    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 3 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 3 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 3 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 33 ms 6372 KB Output is correct
13 Correct 65 ms 6228 KB Output is correct
14 Correct 53 ms 6628 KB Output is correct
15 Correct 40 ms 4840 KB Output is correct
16 Correct 41 ms 6244 KB Output is correct
17 Correct 67 ms 6372 KB Output is correct
18 Correct 69 ms 6844 KB Output is correct
19 Correct 68 ms 6420 KB Output is correct
20 Correct 41 ms 6372 KB Output is correct
21 Correct 54 ms 6372 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 3 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1900 KB Output is correct
4 Correct 5 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 3 ms 1900 KB Output is correct
10 Correct 3 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 3 ms 1900 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 2 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 2 ms 1900 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 2 ms 2028 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 2 ms 2028 KB Output is correct
23 Correct 2 ms 2028 KB Output is correct
24 Correct 2 ms 2028 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 2 ms 2028 KB Output is correct
16 Correct 3 ms 1900 KB Output is correct
17 Correct 2 ms 1900 KB Output is correct
18 Correct 2 ms 1900 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 2 ms 2028 KB Output is correct
21 Correct 2 ms 2048 KB Output is correct
22 Correct 2 ms 2028 KB Output is correct
23 Correct 2 ms 2028 KB Output is correct
24 Correct 2 ms 2028 KB Output is correct
25 Correct 50 ms 7268 KB Output is correct
26 Correct 78 ms 7908 KB Output is correct
27 Correct 103 ms 8164 KB Output is correct
28 Correct 109 ms 8788 KB Output is correct
29 Correct 107 ms 8292 KB Output is correct
30 Correct 53 ms 5352 KB Output is correct
31 Correct 56 ms 7652 KB Output is correct
32 Correct 81 ms 8804 KB Output is correct
33 Correct 83 ms 7984 KB Output is correct
34 Correct 85 ms 8804 KB Output is correct
35 Correct 57 ms 8292 KB Output is correct
36 Correct 81 ms 8548 KB Output is correct
37 Correct 42 ms 7268 KB Output is correct