oj.uz

Submission #967193

# Submission time Handle Problem Language Result Execution time Memory
967193 2024-04-21T13:32:38 Z ByeWorld Palembang Bridges (APIO15_bridge) C++14
22 / 100
 85 ms 4636 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 = 1e18+10;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;

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

signed main(){
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> K >> n;
	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<=vec.size()-1; i++){
		ans += abs(vec[(siz+1)/2]-vec[i]);
	}
	ans += siz/2;
	cout << ans << '\n';
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:33:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=1; i<=vec.size()-1; i++){
      |               ~^~~~~~~~~~~~~~
bridge.cpp:32:6: warning: unused variable 'MN' [-Wunused-variable]
   32 |  int MN = INF, siz = vec.size()-1;
      |      ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 448 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 36 ms 3236 KB Output is correct
13 Correct 77 ms 4292 KB Output is correct
14 Correct 49 ms 3780 KB Output is correct
15 Correct 45 ms 2644 KB Output is correct
16 Correct 54 ms 3612 KB Output is correct
17 Correct 67 ms 4288 KB Output is correct
18 Correct 67 ms 4048 KB Output is correct
19 Correct 85 ms 4636 KB Output is correct
20 Correct 60 ms 3908 KB Output is correct
21 Correct 68 ms 4032 KB Output is correct

Subtask #3
0 / 9.0

# 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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -