# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31320 | 2017-08-18T02:03:21 Z | nibnalin | Palembang Bridges (APIO15_bridge) | C++14 | 0 ms | 2020 KB |
#include <iostream> #include <cstdio> #include <vector> #include <cmath> #include <algorithm> using namespace std; const int maxn = int(1e6)+5; vector<int> A; void solve2(int n) { printf("-1\n"); } void solve1(int n) { int res = 0; for(int i = 0;i < n;i++) { string s, t; int a, b; cin >> s >> a >> t >> b; if(s == t) res += b-a; else { A.push_back(a), A.push_back(b); res++; } } sort(A.begin(), A.end()); int mid = A[(int(A.size())-1)/2]; //cout << mid << "\n"; for(auto it: A) { res += abs(it-mid); } printf("%d\n", res); } int main(void) { int n, k; scanf("%d%d", &k, &n); if(k == 1) solve1(n); else solve2(n); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2020 KB | Output is correct |
2 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2020 KB | Output is correct |
2 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |