oj.uz

Submission #144134

# Submission time Handle Problem Language Result Execution time Memory
144134 2019-08-16T07:47:08 Z icypiggy Vision Program (IOI19_vision) C++14
0 / 100
 31 ms 3368 KB 
#include <vector>
#include "vision.h"
using namespace std;
void construct_network(int H, int W, int K) {
    vector<int> vdiag[H+W-1];
    vector<int> vdiag2[H+W-1];
    int idx_diag[H+W-1];
    int idx_diag2[H+W-1];
    for(int i=0; i<H; i++) {
        for(int j=0; j<W; j++) {
            vdiag[i+j].push_back(i*W+j);
            vdiag2[H-1-i+j].push_back(i*W+j);
            //cout << "vdiag: " << i*W+j << " " << i+j << " " << H-1-i+j << "\n";
        }
    }
    for(int i=0; i<H+W-1; i++) {
        idx_diag[i] = add_or(vdiag[i]);
    }

    for(int i=0; i<H+W-1; i++) {
        idx_diag2[i] = add_or(vdiag2[i]);
    }
    vector<int> tmp;
    for(int i=0; i+K<H+W-1; i++) {
        tmp.push_back(add_and({idx_diag[i], idx_diag[i+K]}));
        tmp.push_back(add_and({idx_diag2[i], idx_diag2[i+K]}));
    }
    vector<int> tmp2; // if any fail, we fail
    vector<int> vtmp;
    vector<int> vtmp2;
    for(int i=H+W-2; i>K; i--) {
        vtmp.push_back(idx_diag[i]);
        vtmp2.push_back(idx_diag2[i]);
        //cout << idx_diag[i] << "!!!\n";
    }
    for(int i=0; i+K<H+W-2; i++) {
        /*cout << i << ": ";
        for(int i: vtmp) {
            cout << i << " ";
        }
        cout << "\n";*/
        tmp2.push_back(add_and({idx_diag[i], add_or(vtmp)}));
        tmp2.push_back(add_and({idx_diag2[i], add_or(vtmp2)}));
        vtmp.pop_back();
        vtmp2.pop_back();
    }
    //add_or(tmp);
    add_and({add_or(tmp), add_not(add_or(tmp2))});
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
5 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3368 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 7 ms 888 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 17 ms 2040 KB Output is correct
8 Correct 21 ms 2040 KB Output is correct
9 Correct 30 ms 3320 KB Output is correct
10 Incorrect 4 ms 276 KB WA in grader: Instruction with no inputs
11 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -