This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
// TEST CASE 5
/*
vector<int> toor;
for(int i = 0; i < max(H, W)-K; i++) {
vector<int> toadd = {i, i+K};
toor.push_back(add_and(toadd));
}
add_or(toor);
*/
// TEST CASE 6
vector<int> toor;
for(int i = 0; i < H; i++) {
if(K-i < W) {
toor.push_back(K-i + W*i);
}
}
add_or(toor);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |