oj.uz

답안 #249106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249106 2020-07-14T10:26:13 Z Gurban Palembang Bridges (APIO15_bridge) C++17
22 / 100
 77 ms 12512 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ss second
#define ff first
#define N 200005
#define inf 1000000009
#define ll long long
#define pii pair<ll,int>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const ll mod = 1e9+7; //998244353;
ll modpow(ll a, ll e) {
	if (e == 0) return 1;
	ll x = modpow(a * a % mod, e >> 1);
	return e & 1 ? x * a % mod : x;
}

int n,k,s,e;
char c,p;
vector <pii>v,adj;
ll ans,add,cep[N],sag[N],num,pos;

int main(){
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	
	scanf("%d%d",&k,&n);
	for(int i = 1;i <= n;i++){
		scanf(" %c%d %c%d",&c,&s,&p,&e);
		if(s < e) swap(s,e);
		if(c == p) add += s-e;
		else v.pb({s,1}),v.pb({e,0}),adj.pb({e,s});
	}
	sort(all(v));
	//for(auto i : v) cout << i.ff << ' ' << i.ss << '\n';
	for(int i = 0;i < sz(v);i++){
		if(i > 0) cep[i] = cep[i-1] + num*(v[i].ff-v[i-1].ff);
		if(v[i].ss == 1) num++;
	}
	num = 0,ans = 1e18;
	for(int i = sz(v)-1;i >= 0;i--){
		if(i < sz(v)-1) sag[i] = sag[i+1] + num*(v[i+1].ff-v[i].ff);
		if(v[i].ss == 0) num++;
		if(ans > cep[i]+sag[i]){
			ans = cep[i]+sag[i];
			pos = v[i].ff;
		}
	}
	ans = 0;
	for(auto i : adj){
		ans += i.ss-i.ff + 1;
		if(pos > i.ss or pos < i.ff) ans += 2ll*min(abs(i.ss-pos),abs(i.ff-pos));
		
	}
	printf("%lld",ans+add);
}
/*
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&k,&n);
  ~~~~~^~~~~~~~~~~~~~
bridge.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c%d %c%d",&c,&s,&p,&e);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 66 ms 10984 KB Output is correct
13 Correct 77 ms 12508 KB Output is correct
14 Correct 60 ms 10604 KB Output is correct
15 Correct 45 ms 7268 KB Output is correct
16 Correct 59 ms 11904 KB Output is correct
17 Correct 59 ms 12512 KB Output is correct
18 Correct 59 ms 12124 KB Output is correct
19 Correct 76 ms 12508 KB Output is correct
20 Correct 59 ms 12128 KB Output is correct
21 Correct 66 ms 12252 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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