# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242741 | 2020-06-29T08:20:06 Z | SamAnd | Ferries (NOI13_ferries) | C++17 | 326 ms | 18164 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 100005; int n, m; vector<int> a[N], b[N]; struct ban { int x, d; ban(){} ban(int x, int d) { this->x = x; this->d = d; } }; bool operator<(const ban& a, const ban& b) { return a.d > b.d; } bool c[N]; void solv() { scanf("%d%d", &n, &m); while (m--) { int x, y, z; scanf("%d%d%d", &x, &y, &z); a[y].push_back(x); b[x].push_back(z); } for (int x = 1; x <= n; ++x) { sort(all(b[x])); } priority_queue<ban> q; q.push(ban(n, 0)); while (1) { ban t; do { t = q.top(); q.pop(); } while (c[t.x]); c[t.x] = true; if (t.x == 1) { printf("%d\n", t.d); return; } for (int i = 0; i < a[t.x].size(); ++i) { ban h; h.x = a[t.x][i]; h.d = t.d; h.d += b[h.x].back(); b[h.x].pop_back(); q.push(h); } } } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 4992 KB | Output is correct |
2 | Correct | 8 ms | 4992 KB | Output is correct |
3 | Correct | 18 ms | 6272 KB | Output is correct |
4 | Correct | 143 ms | 16228 KB | Output is correct |
5 | Correct | 132 ms | 16280 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 4992 KB | Output is correct |
2 | Correct | 8 ms | 5120 KB | Output is correct |
3 | Correct | 17 ms | 6144 KB | Output is correct |
4 | Correct | 74 ms | 10608 KB | Output is correct |
5 | Correct | 86 ms | 13688 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 6144 KB | Output is correct |
2 | Correct | 25 ms | 6144 KB | Output is correct |
3 | Correct | 288 ms | 16888 KB | Output is correct |
4 | Correct | 313 ms | 17400 KB | Output is correct |
5 | Correct | 326 ms | 16504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 298 ms | 16888 KB | Output is correct |
2 | Correct | 287 ms | 16888 KB | Output is correct |
3 | Correct | 265 ms | 17252 KB | Output is correct |
4 | Correct | 294 ms | 18164 KB | Output is correct |
5 | Correct | 300 ms | 18036 KB | Output is correct |