oj.uz

답안 #667870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667870 2022-12-02T07:33:38 Z coding_snorlax Vision Program (IOI19_vision) C++14
0 / 100
 342 ms 1828 KB 
#include<bits/stdc++.h>
#include "vision.h"
using namespace std;
int List1[200006]={0};
int row,column;
int num (int i,int j){
    return i*column+j;
}
int dis (int i,int j,int k,int l){
    return abs(i-k)+abs(j-l);
}
void construct_network(int H,int W,int K){
    row=H;
    column=W;
    vector<int> s;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            s.clear();
            for(int k=0;k<H;k++){
                for(int l=0;l<W;l++){
                    if(dis(i,j,k,l)==K) s.push_back(num(k,l));
                }
            }
            if((int)s.size()==0){
                s.push_back(0);
                add_xor(s);
            }
            else{
                add_xor(s);
            }
        }
    }
    vector<int> s1={0,H*W};
    for(int i=0;i<H*W;i++){
        add_and(s1);
        s1[0]++;
        s1[1]++;
    }
    vector<int> s2;
    for(int i=0;i<H*W;i++){
        s2.push_back(i+2*H*W);
    }
    add_or(s2);
    return;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 11 ms 720 KB Output is correct
4 Correct 24 ms 1828 KB Output is correct
5 Correct 18 ms 1356 KB Output is correct
6 Incorrect 13 ms 928 KB on inputs (0, 0), (66, 28), expected 0, but computed 1
7 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 342 ms 1032 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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