oj.uz

Submission #681516

# Submission time Handle Problem Language Result Execution time Memory
681516 2023-01-13T08:54:13 Z ansgar Palembang Bridges (APIO15_bridge) C++17
22 / 100
 47 ms 4340 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vb vector<bool>
#define vc vector<char>
#define vvc vector<vc>
#define vvb vector<vb>z
#define si set<int>
#define mii map<int,int>

const int mod=1e9+7;
const int N=2e5+1;
const int LN=LLONG_MAX/10;
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int k,n;
    cin>>k>>n;
    int ans=0;
    vi P;
    for(int i=0;i<n;i++){
        char e1,e2;
        int p1,p2;
        cin>>e1>>p1>>e2>>p2;
        if(e1==e2){
            ans+=abs(p1-p2);
        }
        else{
            P.push_back(p1);
            P.push_back(p2);
        }
    }
    int sol=LN;
    sort(P.begin(),P.end());
    if(k==1){
        int aft=P.size();
        int sum=0;
        for(int i : P)sum-=i;
        for(int i=aft-1;i>=aft/2;i--){
            sum+=2*P[i];
        }
        sol=sum;
    }
    else{

    }
    if(P.size()==0)sol=0;
    std::cout<<ans+sol+P.size()/2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 20 ms 3232 KB Output is correct
13 Correct 37 ms 4340 KB Output is correct
14 Correct 28 ms 3664 KB Output is correct
15 Correct 22 ms 2728 KB Output is correct
16 Correct 26 ms 3768 KB Output is correct
17 Correct 28 ms 4292 KB Output is correct
18 Correct 33 ms 3968 KB Output is correct
19 Correct 47 ms 4256 KB Output is correct
20 Correct 27 ms 3892 KB Output is correct
21 Correct 36 ms 3972 KB Output is correct

Subtask #3
0 / 9.0

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