oj.uz

Submission #1094388

# Submission time Handle Problem Language Result Execution time Memory
1094388 2024-09-29T14:37:58 Z ShaShi Palembang Bridges (APIO15_bridge) C++17
22 / 100
 114 ms 17088 KB 
#include <bits/stdc++.h>
 
#define int long long 
 
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
 
#define F first 
#define S second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) cout << x << "\n", exit(0);
#define pii pair<int, int>
#define pll pair<long long, long long>
#define endl "\n"
 
 
 
using namespace std;
typedef long long ll;
// typedef __int128_t lll;
typedef long double ld;

 
const int MAXN = (int)1e6 + 7;
const int MOD = 998244353;
const ll INF = (ll)1e18 + 7;

 
int n, m, k, tmp, t, tmp2, tmp3, tmp4, u, v, w, flag, q, ans, N, l, r, mid;
vector<pii> vec;
map<int, int> cnt;
char ch, ch2;


int32_t main() {
    #ifdef LOCAL
    freopen("inp.in", "r", stdin);
    freopen("res.out", "w", stdout);
    #else
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif

    cin >> k >> n;

    for (int i=1; i<=n; i++) {
        cin >> ch >> u >> ch2 >> v;

        if (ch == ch2) ans += abs(u-v);
        else cnt[u]++, cnt[v]++, vec.pb({u, v}), tmp2 += 2;
    }

    tmp = 0;

    for (auto cur: cnt) {
        tmp += cur.S;

        // cout << cur.F << " " << cur.S << endl;

        if (tmp+tmp >= tmp2) {
            tmp = cur.F;
            break;
        }
    }

    for (auto cur:cnt) ans += abs(cur.F-tmp)*cur.S;

    cout << ans+vec.size() << endl;
    
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 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 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 14 ms 3388 KB Output is correct
13 Correct 114 ms 16828 KB Output is correct
14 Correct 32 ms 4040 KB Output is correct
15 Correct 51 ms 9992 KB Output is correct
16 Correct 14 ms 3796 KB Output is correct
17 Correct 55 ms 16808 KB Output is correct
18 Correct 57 ms 16316 KB Output is correct
19 Correct 79 ms 16252 KB Output is correct
20 Correct 16 ms 3800 KB Output is correct
21 Correct 54 ms 17088 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 428 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 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 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 -