oj.uz

Submission #667016

# Submission time Handle Problem Language Result Execution time Memory
667016 2022-11-30T07:30:55 Z mychecksedad Thousands Islands (IOI22_islands) C++17
0 / 100
 3 ms 604 KB 
#include <bits/stdc++.h>
#include <utility>
using namespace std;

pair<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){
    int a = 0, b = 0;
    for(int i = 0; i < M; ++i) if(U[i] == 0) a++;
    for(int i = 0; i < M; ++i) if(U[i] == 1) b++;
    if(a >= 2 && b >= 1){
        return {1, {0, 1, 0, 1, 0, 1, 0}};
    }   
    return {0, {}}; 
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 3 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 3 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -