oj.uz

답안 #905883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
905883 2024-01-13T06:17:09 Z Sir_Ahmed_Imran Palembang Bridges (APIO15_bridge) C++17
22 / 100
 69 ms 3788 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define N 100001
int m;
vector<ll> x,y;
ll dist(ll p,ll q){
    ll o=0;
    for(int i=0;i<m;i++){
        if((x[i]>=p && p>=y[i]) || 
        (x[i]>=q && q>=y[i])) continue;
        o+=min(min(abs(p-x[i]),abs(p-y[i]))
        ,min(abs(q-x[i]),abs(q-y[i])))*2;
    }
    return o;
}
void solve1(){
    char c,d;
    ll n,o,p,q,r;
    cin>>n;
    for(int i=o=0;i<n;i++){
        cin>>c>>p>>d>>q;
        o+=abs(p-q);
        if(c!=d){
            o++;
            m++;
            x.append(max(p,q));
            y.append(min(p,q));
        }
    }
    r=0;
    for(int j=536870912;j>0;j/=2)
        if(dist(r+j,r+j)<=dist(r+j-1,r+j-1))
            r+=j;
    cout<<o+dist(r,r);
}
void solve2(){
    cout<<0<<nl;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int t;
    cin>>t;
    if(t==1) solve1();
    else solve2();
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 372 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 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 600 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 1 ms 348 KB Output is correct
12 Correct 37 ms 3012 KB Output is correct
13 Correct 54 ms 3756 KB Output is correct
14 Correct 54 ms 2768 KB Output is correct
15 Correct 33 ms 2516 KB Output is correct
16 Correct 27 ms 3272 KB Output is correct
17 Correct 38 ms 3536 KB Output is correct
18 Correct 24 ms 3528 KB Output is correct
19 Correct 69 ms 3788 KB Output is correct
20 Correct 55 ms 3684 KB Output is correct
21 Correct 57 ms 3528 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -