oj.uz

Submission #25067

# Submission time Handle Problem Language Result Execution time Memory
25067 2017-06-20T05:49:02 Z 김종범(#1056) Palembang Bridges (APIO15_bridge) C++14
22 / 100
 86 ms 6056 KB 
#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

struct PT {
	int x, y;
	PT() {}
	PT(int xx, int yy) : x(xx), y(yy) {}
	bool operator<(const PT &o) const{return x+y < o.x+o.y;}
};
struct SOL {
	priority_queue<int> m; //minus slope
	priority_queue<int, vector<int>, greater<int> > p; //plus slope;
	ll ans;
	SOL() : ans(0) {}
	void add(int l, int r) {
		m.push(l); p.push(r);
//		printf("%d %d add\n", l, r);
		while(true) {
			int mm = m.top();
			int pp = p.top(); 
			if(mm <= pp) return;
			p.pop(); m.pop();
			ans += abs(pp - mm);
			m.push(pp); p.push(mm);
//			printf("%d %d pop\n", mm, pp);
//			printf("%d %d push\n", pp, mm);
		}
	}
};

const int MAX_N = 1e5 + 100;

int K, N;
ll Ans = 0;
vector<PT> Ps;
ll DyL[MAX_N], DyR[MAX_N];
int main() {
	cin >> K >> N;
	REP(i, N) {
		char sa[3], sb[3]; int x, y;
		scanf("%s%d%s%d", sa, &x, sb, &y);
		if(sa[0] != sb[0]) {
			Ans += 1;
			Ps.push_back(PT(min(x, y), max(x, y)));
		}
		Ans += abs(x-y);
	}
	sort(ALL(Ps));

	if(K == 1) {
		SOL sol;
		for(PT &p : Ps) sol.add(p.x, p.y);
		Ans += sol.ans * 2;
		printf("%lld\n", Ans);
	} else {
		SOL lsol, rsol;
		for(int i=0; i<SZ(Ps); i++) {
			PT &p = Ps[i];
			lsol.add(p.x, p.y);
			DyL[i+1] = lsol.ans * 2;
		}
		for(int i=SZ(Ps)-1; i>=0; i--) {
			PT &p = Ps[i];
			rsol.add(p.x, p.y);
			DyR[i] = rsol.ans * 2;
		}

		ll nowAns = LINF;
		for(int i=0; i<SZ(Ps); i++) 
			nowAns = min(nowAns, DyL[i] + DyR[i+1]);
		Ans += nowAns;
		printf("%lld\n", Ans);
	}
	return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:53:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s%d%s%d", sa, &x, sb, &y);
                                    ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3588 KB Output is correct
2 Correct 0 ms 3588 KB Output is correct
3 Correct 0 ms 3588 KB Output is correct
4 Correct 0 ms 3588 KB Output is correct
5 Correct 0 ms 3588 KB Output is correct
6 Correct 0 ms 3588 KB Output is correct
7 Correct 0 ms 3588 KB Output is correct
8 Correct 0 ms 3588 KB Output is correct
9 Correct 0 ms 3588 KB Output is correct
10 Correct 0 ms 3588 KB Output is correct
11 Correct 0 ms 3588 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3588 KB Output is correct
2 Correct 0 ms 3588 KB Output is correct
3 Correct 0 ms 3588 KB Output is correct
4 Correct 0 ms 3588 KB Output is correct
5 Correct 0 ms 3588 KB Output is correct
6 Correct 0 ms 3588 KB Output is correct
7 Correct 0 ms 3588 KB Output is correct
8 Correct 0 ms 3588 KB Output is correct
9 Correct 0 ms 3588 KB Output is correct
10 Correct 0 ms 3588 KB Output is correct
11 Correct 0 ms 3588 KB Output is correct
12 Correct 36 ms 6056 KB Output is correct
13 Correct 86 ms 6056 KB Output is correct
14 Correct 63 ms 6056 KB Output is correct
15 Correct 49 ms 5032 KB Output is correct
16 Correct 33 ms 6056 KB Output is correct
17 Correct 79 ms 6056 KB Output is correct
18 Correct 73 ms 6056 KB Output is correct
19 Correct 86 ms 6056 KB Output is correct
20 Correct 73 ms 6056 KB Output is correct
21 Correct 79 ms 6056 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3588 KB Output isn't correct
2 Halted 0 ms 0 KB -