# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
25372 | 2017-06-21T16:44:16 Z | gabrielsimoes | Palembang Bridges (APIO15_bridge) | C++14 | 66 ms | 8252 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pll; int main() { int m, n; scanf("%d %d", &m, &n); char a,c; ll b,d, ans0 = 0; vector<pll> v; for (int i = 0; i < n; i++) { scanf(" %c %lld %c %lld",&a, &b,&c, &d); if (d < b) swap(b,d); if (a == c) ans0 += d - b; else v.push_back(pll(b,d)), ans0++; } if (v.empty()) { printf("%lld\n", ans0); return 0; } if (m == 1) { vector<ll> all; for (pll p : v) all.push_back(p.first), all.push_back(p.second); sort(all.begin(), all.end()); ll x = all[all.size()/2 - 1]; for (ll y : all) ans0 += abs(y - x); printf("%lld\n", ans0); return 0; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Correct | 0 ms | 2024 KB | Output is correct |
3 | Correct | 0 ms | 2024 KB | Output is correct |
4 | Correct | 0 ms | 2024 KB | Output is correct |
5 | Correct | 0 ms | 2024 KB | Output is correct |
6 | Correct | 0 ms | 2024 KB | Output is correct |
7 | Correct | 0 ms | 2024 KB | Output is correct |
8 | Correct | 0 ms | 2024 KB | Output is correct |
9 | Correct | 0 ms | 2024 KB | Output is correct |
10 | Correct | 0 ms | 2024 KB | Output is correct |
11 | Correct | 0 ms | 2024 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Correct | 0 ms | 2024 KB | Output is correct |
3 | Correct | 0 ms | 2024 KB | Output is correct |
4 | Correct | 0 ms | 2024 KB | Output is correct |
5 | Correct | 0 ms | 2024 KB | Output is correct |
6 | Correct | 0 ms | 2024 KB | Output is correct |
7 | Correct | 0 ms | 2024 KB | Output is correct |
8 | Correct | 0 ms | 2024 KB | Output is correct |
9 | Correct | 0 ms | 2024 KB | Output is correct |
10 | Correct | 0 ms | 2024 KB | Output is correct |
11 | Correct | 0 ms | 2024 KB | Output is correct |
12 | Correct | 19 ms | 8252 KB | Output is correct |
13 | Correct | 66 ms | 8252 KB | Output is correct |
14 | Correct | 36 ms | 8252 KB | Output is correct |
15 | Correct | 49 ms | 5180 KB | Output is correct |
16 | Correct | 39 ms | 8252 KB | Output is correct |
17 | Correct | 39 ms | 8252 KB | Output is correct |
18 | Correct | 56 ms | 8252 KB | Output is correct |
19 | Correct | 63 ms | 8252 KB | Output is correct |
20 | Correct | 49 ms | 8252 KB | Output is correct |
21 | Correct | 46 ms | 8252 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Correct | 0 ms | 2024 KB | Output is correct |
3 | Incorrect | 0 ms | 2024 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Correct | 0 ms | 2024 KB | Output is correct |
3 | Incorrect | 0 ms | 2024 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Correct | 0 ms | 2024 KB | Output is correct |
3 | Incorrect | 0 ms | 2024 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |