oj.uz

Submission #982919

# Submission time Handle Problem Language Result Execution time Memory
982919 2024-05-15T03:59:13 Z vjudge1 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 35 ms 2520 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define sz(x) (ll)x.size()
using namespace std;
int n;
void sv1(){
    ll ans=0;vector<ll>vec;
    for(int i=1;i<=n;i++){
        char X,Y;ll x,y;
        cin>>X>>x>>Y>>y;
        if(X==Y)ans+=abs(y-x);
        else vec.pb(x),vec.pb(y),ans++;
    }sort(vec.begin(),vec.end());
    ll med=vec[(sz(vec)-1)/2];
    for(auto it : vec)ans+=abs(med-it);
    cout<<ans;return;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int k;cin>>k>>n;
    if(k==1)sv1();//else sv2();
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 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 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

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 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 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 348 KB Output is correct
12 Correct 16 ms 2520 KB Output is correct
13 Correct 35 ms 2436 KB Output is correct
14 Correct 24 ms 2516 KB Output is correct
15 Correct 18 ms 1500 KB Output is correct
16 Correct 25 ms 2520 KB Output is correct
17 Correct 25 ms 2520 KB Output is correct
18 Correct 29 ms 2520 KB Output is correct
19 Correct 31 ms 2520 KB Output is correct
20 Correct 22 ms 2520 KB Output is correct
21 Correct 28 ms 2508 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -