oj.uz

Submission #979368

# Submission time Handle Problem Language Result Execution time Memory
979368 2024-05-10T18:01:56 Z Malix Palembang Bridges (APIO15_bridge) C++14
22 / 100
 88 ms 6596 KB 
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair

ll INF=1e18+10;

int main() {   
//ios::sync_with_stdio(0);
//cin.tie(0);
//freopen("test_input.txt", "r", stdin);
//freopen("test_output.txt", "w", stdout);
    int k,n;cin>>k>>n;
    vector<pair<char,int>> a(n),b(n);
    REP(i,0,n)cin>>a[i].F>>a[i].S>>b[i].F>>b[i].S;
    //cout<<"a";
    ll ans=0;
    pii c;
    REP(i,0,n){
        if(a[i].F==b[i].F){
            ans+=(ll)abs(a[i].S-b[i].S);
        }
        else {
            if(a[i].S>b[i].S)swap(a[i].S,b[i].S);
            c.PB({a[i].S,b[i].S});
        }
    }
    int m=c.size();
    if(m==0){
        cout<<ans;
        return 0;
    }
    sort(c.begin(),c.end());
    if(k==2){
        m--;
        ans+=(ll)abs(c[m].F-c[m].S)+1;
        c.pop_back();
    }

    vi ar;
    REP(i,0,m)ar.PB(c[i].F);
    REP(i,0,m)ar.PB(c[i].S);
    sort(ar.begin(),ar.end());
    REP(i,0,m*2)ans+=(ll)abs(ar[i]-ar[m]);
    cout<<ans+(ll)m;
   
}

Subtask #1
8.0 / 8.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 1 ms 500 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 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 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 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 348 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 49 ms 4896 KB Output is correct
13 Correct 85 ms 6424 KB Output is correct
14 Correct 57 ms 5252 KB Output is correct
15 Correct 49 ms 3788 KB Output is correct
16 Correct 58 ms 5872 KB Output is correct
17 Correct 84 ms 6340 KB Output is correct
18 Correct 71 ms 6084 KB Output is correct
19 Correct 88 ms 6596 KB Output is correct
20 Correct 72 ms 6084 KB Output is correct
21 Correct 82 ms 6088 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 348 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 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -