oj.uz

답안 #239108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239108 2020-06-14T12:14:52 Z zoooma13 Vision Program (IOI19_vision) C++14
8 / 100
 6 ms 640 KB 
#include <bits/stdc++.h>
#include "vision.h"
//#include "grader.cpp"
using namespace std;

int h ,w ,k;
int d(int i ,int j){ return i*w+j; }
int dist(int r ,int c ,int i ,int j){
    return abs(r-i) + abs(j-c);
}

vector <int> getAt(int r ,int c){
    vector <int> ret;
    for(int i=r; i<h; i++)
    for(int j=0; j<w; j++)
        if(!(i==r&&j==c-k) && dist(i ,j ,r ,c) == k)
            ret.push_back(d(i ,j));
    return ret;
}

void construct_network(int H, int W, int K) { h=H ,w=W ,k=K;
    vector<vector <int>> diags(H ,vector<int>(W ,-1));
    int id = h*w;
    for(int i=0; i<1; i++)
    for(int j=0; j<1; j++){
        auto nb = getAt(i ,j);
        if(nb.size())
            add_or(nb) ,diags[i][j] = id++;
    }
    vector<vector <int>> prs(H ,vector<int>(W ,-1));
    for(int i=0; i<1; i++)
    for(int j=0; j<1; j++)
        if(~diags[i][j])
            add_and({d(i ,j) ,diags[i][j]}) ,prs[i][j] = id++;
    vector<int> tot;
    for(auto&v : prs)
    for(auto&i : v)
        if(~i) tot.push_back(i);
    add_or(tot);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 5 ms 256 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 640 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -