# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
796172 |
2023-07-28T07:21:15 Z |
이성호(#10070) |
Security Guard (JOI23_guard) |
C++17 |
|
107 ms |
5832 KB |
#include <iostream>
#include <vector>
using namespace std;
vector<int> adj[100005];
int S[100005];
int N, M, Q;
int main()
{
cin >> N >> M >> Q;
int cnt[2] = {};
for (int i = 1; i <= N; i++) {
cin >> S[i];
cnt[S[i]-1]++;
}
int t;
for (int i = 0; i < 2 * N - 2; i++) cin >> t;
int ans = (N - 1) + max(cnt[1] - 1, 0);
if (S[1] == 1 && cnt[1]) ans++;
if (S[N] == 1 && cnt[1]) ans++;
cout << ans << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Runtime error |
107 ms |
5832 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Runtime error |
107 ms |
5832 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Runtime error |
107 ms |
5832 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Runtime error |
107 ms |
5832 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
5204 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
5204 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Runtime error |
107 ms |
5832 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |