Task: | Sadonkorjuu |
Sender: | stpn129 |
Submission time: | 2022-10-31 18:28:38 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | ACCEPTED | 0.00 s | 1, 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.25 s | 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.31 s | 2 | details |
#10 | ACCEPTED | 0.00 s | 1, 2 | details |
#11 | ACCEPTED | 0.20 s | 2 | details |
#12 | ACCEPTED | 0.10 s | 2 | details |
#13 | ACCEPTED | 0.16 s | 2 | details |
#14 | ACCEPTED | 0.16 s | 2 | details |
#15 | ACCEPTED | 0.00 s | 1, 2 | details |
#16 | ACCEPTED | 0.01 s | 1, 2 | details |
#17 | ACCEPTED | 0.00 s | 1, 2 | details |
#18 | ACCEPTED | 0.00 s | 1, 2 | details |
#19 | ACCEPTED | 0.00 s | 1, 2 | details |
#20 | ACCEPTED | 0.00 s | 1, 2 | details |
#21 | ACCEPTED | 0.16 s | 2 | details |
#22 | ACCEPTED | 0.16 s | 2 | details |
#23 | ACCEPTED | 0.16 s | 2 | details |
#24 | ACCEPTED | 0.01 s | 1, 2 | details |
#25 | TIME LIMIT EXCEEDED | -- | 2 | details |
#26 | ACCEPTED | 0.00 s | 1, 2 | details |
#27 | ACCEPTED | 0.26 s | 2 | details |
#28 | ACCEPTED | 0.00 s | 1, 2 | details |
#29 | ACCEPTED | 0.14 s | 2 | details |
#30 | ACCEPTED | 0.00 s | 1, 2 | details |
#31 | ACCEPTED | 0.14 s | 2 | details |
Compiler report
input/code.cpp: In function 'void solve()': input/code.cpp:45:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 45 | for (int i = 0; i < g[v].size(); ++i) { | ~~^~~~~~~~~~~~~
Code
#include "bits/stdc++.h"#define int long longusing namespace std;void init_code() {ios_base::sync_with_stdio(false);cin.tie(NULL);#ifndef ONLINE_JUDGEfreopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);#endif}const int inf = 1e9 + 1;void solve() {int n;cin >> n;vector<int> p(n + 1);set<int> q;vector<pair<int, int>> g[n + 1];vector<int> dist(n + 1, inf);for (int i = 1; i <= n; ++i) {cin >> p[i];if (!p[i]) {dist[i] = 0;q.insert(i);}}for (int i = 1; i <= n; ++i) {int x, y, c;cin >> x >> y >> c;g[x].push_back({y, c});g[y].push_back({x, c});}int v;while (!q.empty()) {v = *q.begin();q.erase(q.begin());for (int i = 0; i < g[v].size(); ++i) {if (p[g[v][i].first] && dist[g[v][i].first] > dist[v] + g[v][i].second ) {dist[g[v][i].first] = dist[v] + g[v][i].second;q.insert(g[v][i].first);}}}int res = 0;for (int i = 1; i <= n; ++i) {res += dist[i];}cout << res << '\n';}signed main() {init_code();int t = 1;//cin >> t;while (t--) {solve();}return 0;}/*vector<int> g[n * n];for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {for (int x = 0; x < n; ++x) {if (a[i][j] > a[x][j]) {g[i * n + j].push_back(x * n + j);}}for (int y = 0; y < n; ++y) {if (a[i][j] > a[i][y]) {g[i * n + j].push_back(i * n + y);}}}}for (int i = 0; i < n * n; ++i) {for (int j = 0; j < g[i].size(); ++j) {cout << g[i][j] << ' ';}cout << "\n";}int n;cin >> n;vector<vector<int>> a(n, vector<int> (n));for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {cin >> a[i][j];}}vector<int> g[n];vector<pair<int, int>> moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int n, m;cin >> n >> m;char x;pair<int,int> sa, sb;vector<vector<int>> a(n, vector<int> (m));for (int i = 0; i < n; ++i){for (int j = 0; j < m; ++j) {cin >> x;if (x == '#') {a[i][j] = 0;} else if (x == '.'){a[i][j] = 1;} else if (x == 'A'){a[i][j] = 2;sa = {i, j};} else if (x == 'B'){a[i][j] = 3;sb = {i, j};}}}vector<vector<int>> used(n, vector<int> (m));used[sa.first][sa.second] = 1; used[sb.first][sb.second] = 2;set<pair<int, int>> q;q.insert(sa);pair<int, int> v;vector<pair<int, int>>while (!q.empty()) {v = *q.begin();q.erase(q.begin());for (auto mv : moves) {int x = v.first + mv.first, y = v.second + mv.second;if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {used[x][y] = 1;q.insert({x, y});}}}q.insert(sb);while (!q.empty()) {v = *q.begin();q.erase(q.begin());for (auto mv : moves) {int x = v.first + mv.first, y = v.second + mv.second;if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 0) {used[x][y] = 2;q.insert({x, y});} else if (x >= 0 && x < n && y >= 0 && y < m && a[x][y] == 1 && used[x][y] == 1) {cout << 1 << '\n';return;}}}for (int i = 0; i < ; ++i) {}*/
Test details
Test 1
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
1 0 |
correct output |
---|
0 |
user output |
---|
(empty) |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
correct output |
---|
60 |
user output |
---|
60 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
correct output |
---|
80 |
user output |
---|
80 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
correct output |
---|
6 |
user output |
---|
6 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5506363 |
user output |
---|
5506363 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1795118520 |
user output |
---|
1795118520 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
correct output |
---|
293576 |
user output |
---|
293576 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
816932444 |
user output |
---|
816932444 |
Test 10
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
3089 |
user output |
---|
3089 |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
40839 |
user output |
---|
40839 |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5683983203973 |
user output |
---|
5683983203973 |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ... |
correct output |
---|
58572993 |
user output |
---|
58572993 |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
32755 |
user output |
---|
32755 |
Test 15
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
126238345 |
user output |
---|
126238345 |
Test 16
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
correct output |
---|
278678 |
user output |
---|
278678 |
Test 17
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
correct output |
---|
34929 |
user output |
---|
34929 |
Test 18
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1543963 |
user output |
---|
1543963 |
Test 19
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
39606 |
user output |
---|
39606 |
Test 20
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
correct output |
---|
321598 |
user output |
---|
321598 |
Test 21
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
978670626 |
user output |
---|
978670626 |
Test 22
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
375218 |
user output |
---|
375218 |
Test 23
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ... |
correct output |
---|
60422556 |
user output |
---|
60422556 |
Test 24
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
291990 |
user output |
---|
291990 |
Test 25
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
59607954 |
user output |
---|
(empty) |
Test 26
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
990 |
user output |
---|
990 |
Test 27
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
199982 |
user output |
---|
199982 |
Test 28
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
7987 |
user output |
---|
7987 |
Test 29
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
3137875 |
user output |
---|
3137875 |
Test 30
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
4657693 |
user output |
---|
4657693 |
Test 31
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1652889357 |
user output |
---|
1652889357 |