Submission #721230

# Submission time Handle Problem Language Result Execution time Memory
721230 2023-04-10T14:14:53 Z nguyentunglam Vision Program (IOI19_vision) C++17
0 / 100
242 ms 1164 KB
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;

void construct_network(int h, int w, int K) {
    vector<int> lst;
    int timer = 0;
    for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) {
        for(int k = i; k < h; k++) for(int l = 0; l < w; l++) {
            if (i == k && j > l) continue;
            if (abs(i - k) + abs(j - l) == K) {
                lst.push_back(add_and({i * w + j, k * w + l}));
                timer++;
            }
        }
    }
    cout << timer << endl;
    if (lst.empty()) return;
    add_or(lst);
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 242 ms 1164 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -