Submission #967214

# Submission time Handle Problem Language Result Execution time Memory
967214 2024-04-21T14:03:03 Z ByeWorld Palembang Bridges (APIO15_bridge) C++14
22 / 100
32 ms 2624 KB
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const int MAXN = 2e5+10;
const int INF = 4e18+10;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;

int K, n;
int ans;
vector <int> vec;
vector <pii> seg;
int pr[MAXN];

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> K >> n;
	if(K==1){
		// exit(0);
		vec.pb(-1);
		for(int i=1; i<=n; i++){
			char x, y; int a, b;
			cin >> x >> a >> y >> b; a++; b++;
			if(x==y) ans += abs(a-b);
			else {
				vec.pb(a); vec.pb(b);
			}
		}
		sort(vec.begin(), vec.end()); 

		int MN = INF, siz = vec.size()-1;
		for(int i=1; i<=siz; i++){
			ans += abs(vec[(siz+1)/2]-vec[i]);
		}
		ans += siz/2;
		cout << ans << '\n';
	} else {
		vector <int> cc; cc.pb(-1);
		for(int i=1; i<=n; i++){
			char x, y; int a, b;
			cin >> x >> a >> y >> b; a++; b++;
			if(x==y) ans += abs(a-b);
			else {
				if(a > b) swap(a, b);
				seg.pb({a, b});
				cc.pb(a); cc.pb(b);
			}
		}
		// sort(seg.begin(), seg.end()); 
		// sort(cc.begin(), cc.end());
		// cc.resize(unique(cc.begin(), cc.end()) - cc.begin());

		// cout << ans << " ans\n";
		int MN = INF, all = cc.size()-1, las = 1;
		for(int i=1; i<=all; i++){
			for(int j=1; j<=all; j++){
				int te = 0, le = cc[i], ri = cc[j];

				for(auto ed : seg){
					int l = ed.fi, r = ed.se;

					// if(l<=le && le<=r) te += (r-l);
					// else if(l<=ri && ri<=r) te += (r-l);
					// else {
						te += min(abs(l-le)+abs(r-le), abs(l-ri)+abs(r-ri));
					// }
				}
				MN = min(MN, te);
			}
		}
		ans += seg.size();
		cout << ans+MN << '\n';
	}
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:35:7: warning: unused variable 'MN' [-Wunused-variable]
   35 |   int MN = INF, siz = vec.size()-1;
      |       ^~
bridge.cpp:58:36: warning: unused variable 'las' [-Wunused-variable]
   58 |   int MN = INF, all = cc.size()-1, las = 1;
      |                                    ^~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 16 ms 2580 KB Output is correct
13 Correct 31 ms 2520 KB Output is correct
14 Correct 23 ms 2520 KB Output is correct
15 Correct 18 ms 1500 KB Output is correct
16 Correct 19 ms 2520 KB Output is correct
17 Correct 21 ms 2584 KB Output is correct
18 Correct 26 ms 2520 KB Output is correct
19 Correct 32 ms 2520 KB Output is correct
20 Correct 25 ms 2480 KB Output is correct
21 Correct 29 ms 2624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -