oj.uz

답안 #1048971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048971 2024-08-08T11:45:33 Z Dalek_of_Rivia Vision Program (IOI19_vision) C++17
8 / 100
 3 ms 808 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> Ns;
	int inf = 0, sup = H-1;
    while(inf!=sup){
        Ns.clear();
        int m = (inf+sup)/2;
        for(int i=inf; i<=m; i++){
            for(int j=0; j<W; j++){
                Ns.push_back(W*i+j);
            }
        }
        if(add_or(Ns)){
            sup=m;
        }else{
            inf=m+1;
        }
    }
    int x = inf;
    inf = 0, sup = W-1;
    while(inf!=sup){
        Ns.clear();
        int m = (inf+sup)/2;
        for(int i=x; i<=x; i++){
            for(int j=inf; j<=m; j++){
                Ns.push_back(W*i+j);
            }
        }
        if(add_or(Ns)){
            sup=m;
        }else{
            inf=m+1;
        }
    }
    int y = inf;
    Ns.clear();
    for(int i=0; i<H; i++){
        for(int j=0; j<W; j++){
            if(abs(i-x)+abs(j-y)==K){
                Ns.push_back(W*i+j);
            }
        }
    }
    add_or(Ns);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
8.0 / 8.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 780 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 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 0, but computed 1
3 Halted 0 ms 0 KB -