oj.uz

Submission #922680

# Submission time Handle Problem Language Result Execution time Memory
922680 2024-02-06T01:33:15 Z irmuun Palembang Bridges (APIO15_bridge) C++17
9 / 100
 2000 ms 600 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll k,n;
    cin>>k>>n;
    vector<char>p(n),q(n);
    vector<ll>s(n),t(n);
    set<ll>st;
    for(ll i=0;i<n;i++){
        cin>>p[i]>>s[i]>>q[i]>>t[i];
        if(s[i]>t[i]) swap(s[i],t[i]);
        st.insert(s[i]);
        st.insert(t[i]);
    }
    ll ans=1e18;
    for(auto x:st){
        for(auto y:st){
            ll cur=0;
            for(ll i=0;i<n;i++){
                if(p[i]==q[i]){
                    cur+=t[i]-s[i];
                }
                else{
                    ll c1=abs(s[i]-x)+abs(t[i]-x),c2=abs(s[i]-y)+abs(t[i]-y);
                    cur+=min(c1,c2)+1;
                }
            }
            ans=min(ans,cur);
        }
    }
    cout<<ans;
}

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

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

Subtask #3
9.0 / 9.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 0 ms 348 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 11 ms 464 KB Output is correct
9 Correct 10 ms 464 KB Output is correct
10 Correct 10 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 11 ms 348 KB Output is correct

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 Correct 0 ms 344 KB Output is correct
4 Correct 10 ms 464 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 11 ms 348 KB Output is correct
9 Correct 11 ms 348 KB Output is correct
10 Correct 10 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 11 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 25 ms 480 KB Output is correct
15 Execution timed out 2070 ms 348 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 10 ms 464 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 11 ms 464 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 25 ms 348 KB Output is correct
15 Execution timed out 2069 ms 348 KB Time limit exceeded
16 Halted 0 ms 0 KB -