# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
213583 | 2020-03-26T08:19:03 Z | SamAnd | Cheap flights (LMIO18_pigus_skrydziai) | C++17 | 3000 ms | 82168 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair const int N = 5003; int n, m; vector<pair<int, int> > a[N]; map<pair<int, int>, int> mp; int main() { scanf("%d%d", &n, &m); for (int i = 0; i < m; ++i) { int x, y, z; scanf("%d%d%d", &x, &y, &z); a[x].push_back(m_p(y, z)); a[y].push_back(m_p(x, z)); mp[m_p(x, y)] = z; mp[m_p(y, x)] = z; } long long ans = 0; for (int x = 1; x <= n; ++x) { long long yans = 0; for (int i = 0; i < a[x].size(); ++i) { yans += a[x][i].second; } ans = max(ans, yans); } for (int x = 1; x <= n; ++x) { for (int i = 0; i < a[x].size(); ++i) { for (int j = i + 1; j < a[x].size(); ++j) { int h1 = a[x][i].first; int h2 = a[x][j].first; if (mp.find(m_p(h1, h2)) != mp.end()) ans = max(ans, a[x][i].second + 0LL + a[x][j].second + mp[m_p(h1, h2)]); } } } printf("%lld\n", ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 512 KB | Output is correct |
3 | Correct | 5 ms | 512 KB | Output is correct |
4 | Correct | 5 ms | 512 KB | Output is correct |
5 | Correct | 5 ms | 512 KB | Output is correct |
6 | Correct | 590 ms | 3584 KB | Output is correct |
7 | Correct | 5 ms | 512 KB | Output is correct |
8 | Correct | 5 ms | 512 KB | Output is correct |
9 | Correct | 5 ms | 512 KB | Output is correct |
10 | Correct | 5 ms | 512 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Correct | 5 ms | 512 KB | Output is correct |
13 | Correct | 7 ms | 512 KB | Output is correct |
14 | Correct | 5 ms | 512 KB | Output is correct |
15 | Correct | 5 ms | 512 KB | Output is correct |
16 | Correct | 5 ms | 512 KB | Output is correct |
17 | Correct | 6 ms | 512 KB | Output is correct |
18 | Correct | 9 ms | 640 KB | Output is correct |
19 | Correct | 11 ms | 768 KB | Output is correct |
20 | Correct | 6 ms | 512 KB | Output is correct |
21 | Correct | 5 ms | 512 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 512 KB | Output is correct |
3 | Correct | 5 ms | 512 KB | Output is correct |
4 | Correct | 5 ms | 512 KB | Output is correct |
5 | Correct | 5 ms | 512 KB | Output is correct |
6 | Correct | 590 ms | 3584 KB | Output is correct |
7 | Correct | 5 ms | 512 KB | Output is correct |
8 | Correct | 5 ms | 512 KB | Output is correct |
9 | Correct | 5 ms | 512 KB | Output is correct |
10 | Correct | 5 ms | 512 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Correct | 5 ms | 512 KB | Output is correct |
13 | Correct | 7 ms | 512 KB | Output is correct |
14 | Correct | 5 ms | 512 KB | Output is correct |
15 | Correct | 5 ms | 512 KB | Output is correct |
16 | Correct | 5 ms | 512 KB | Output is correct |
17 | Correct | 6 ms | 512 KB | Output is correct |
18 | Correct | 9 ms | 640 KB | Output is correct |
19 | Correct | 11 ms | 768 KB | Output is correct |
20 | Correct | 6 ms | 512 KB | Output is correct |
21 | Correct | 5 ms | 512 KB | Output is correct |
22 | Execution timed out | 3103 ms | 82168 KB | Time limit exceeded |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |