oj.uz

Submission #213166

# Submission time Handle Problem Language Result Execution time Memory
213166 2020-03-25T06:08:11 Z SorahISA Palembang Bridges (APIO15_bridge) C++17
22 / 100
 61 ms 6376 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
 
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
 
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
 
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);
 
const int INF = 1E18;
const int mod = 1E9 + 7;

struct Citizen {
    char p, q;
    int s, t;
    
    void Read() {
        cin >> p >> s >> q >> t;
    }
};

int32_t main() {
    fastIO();
    
    int k, n, ans = 0;
    cin >> k >> n;
    
    vector<Citizen> v;
    for (int i = 0; i < n; ++i) {
        Citizen tmp; tmp.Read();
        if (tmp.s > tmp.t) swap(tmp.s, tmp.t);
        ans += tmp.t - tmp.s;
        if (tmp.p != tmp.q) ++ans, v.eb(tmp);
    }
    n = v.size();
    
    if (n == 0) {
        cout << ans << "\n";
        return 0;
    }
    
    if (k == 1) {
        vector<int> p;
        for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p));
        
        int midP = p[n];
        for (int i = 0; i < n; ++i) {
            if (midP < v[i].s) ans += 2 * (v[i].s - midP);
            if (v[i].t < midP) ans += 2 * (midP - v[i].t);
        }
        
        cout << ans << "\n";
        
        return 0;
    }
    
    return 0;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:66:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p));
         ^~~
bridge.cpp:66:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
         for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p));
                                                                 ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 28 ms 6376 KB Output is correct
13 Correct 61 ms 6372 KB Output is correct
14 Correct 42 ms 6000 KB Output is correct
15 Correct 35 ms 3700 KB Output is correct
16 Correct 40 ms 6376 KB Output is correct
17 Correct 43 ms 6376 KB Output is correct
18 Correct 54 ms 6376 KB Output is correct
19 Correct 58 ms 6376 KB Output is correct
20 Correct 43 ms 6376 KB Output is correct
21 Correct 53 ms 6376 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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