oj.uz

답안 #1076369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076369 2024-08-26T13:21:06 Z dosts Palembang Bridges (APIO15_bridge) C++17
22 / 100
 31 ms 4444 KB 
//Dost SEFEROĞLU
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e18;
const int N = 5001;

void solve() { 
    int k,n;
    cin >> k >> n;
    assert(k == 1);
    int ans = 0;
    vi a;
    vi v;
    for (int i=1;i<=n;i++) {
        char c1,c2;
        int x1,x2;
        cin >> c1 >> x1 >> c2 >> x2;
        if (c1 == c2) {
            ans+=abs(x1-x2);
            continue;
        }
        v.push_back(x1),v.push_back(x2);
        ans++;
    }
    sort(all(v));
    int med = v[(v.size()+1)/2];
    for (auto& it : v) ans+=abs(it-med);
    cout << ans << endl;
}
 
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 420 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 0 ms 344 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 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 15 ms 3288 KB Output is correct
13 Correct 31 ms 4428 KB Output is correct
14 Correct 21 ms 3800 KB Output is correct
15 Correct 19 ms 2696 KB Output is correct
16 Correct 18 ms 3796 KB Output is correct
17 Correct 21 ms 4308 KB Output is correct
18 Correct 25 ms 4056 KB Output is correct
19 Correct 30 ms 4444 KB Output is correct
20 Correct 18 ms 4052 KB Output is correct
21 Correct 28 ms 4056 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -