oj.uz

Submission #1069468

# Submission time Handle Problem Language Result Execution time Memory
1069468 2024-08-22T01:22:01 Z giaminh2211 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 28 ms 1532 KB 
#include<bits/stdc++.h>

using namespace std;
using ll=long long;

int k, n;
const int N=1e5+13;
int a[N];
ll res;
char c1, c2;
int x, y;
vector<int> v;

void scan(){
    cin >> k >> n;
    for(int i=1; i<=n; i++){
        cin >> c1 >> x >> c2 >> y;
        if(c1==c2){
            res+=abs(x-y);
        }
        else{
            v.push_back(x);
            v.push_back(y);
            ++res;
        }
    }
    sort(begin(v), end(v));
}

void solve(){
    for(int c: v){
        res+=abs(c-v[v.size()/2]);
    }
    cout << res;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    scan();
    solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 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 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 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 13 ms 1496 KB Output is correct
13 Correct 28 ms 1496 KB Output is correct
14 Correct 20 ms 1532 KB Output is correct
15 Correct 16 ms 1012 KB Output is correct
16 Correct 16 ms 1496 KB Output is correct
17 Correct 27 ms 1520 KB Output is correct
18 Correct 27 ms 1496 KB Output is correct
19 Correct 26 ms 1500 KB Output is correct
20 Correct 18 ms 1500 KB Output is correct
21 Correct 27 ms 1496 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 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.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 -