답안 #1050190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050190 2024-08-09T07:54:31 Z nisanduu Vision Program (IOI19_vision) C++14
0 / 100
13 ms 2008 KB
#include "vision.h"
#include <bits/stdc++.h>
 
using namespace std;
 
bool c(int i,int j,int n,int m){
    if(i<0||j<0||i>=n||j>=m) return false;
    return true;
}
 
void construct_network(int H, int W, int K) {
	vector<int> indexes;
	set<vector<int>> s;
	int n = H, m = W, k = K;
	for(int i=0;i<H;i++){
	    for(int j=0;j<W;j++){
	        int cr = i*W + j;
	        vector<int> vec;
	        for(int r=0;r<=k;r++){
	            int rem = k-r;
	            if(c(i+r,j+rem,n,m)){
	                int nin = (i+r)*W + (j+rem);
	                //int in = add_and({nin,cr});
	                vec.push_back(nin);
	            }
	            if(c(i-r,j+rem,n,m)){
	                int nin = (i-r)*W + (j+rem);
	                //int in = add_and({nin,cr});
	                vec.push_back(nin);
	            }
	            if(c(i+r,j-rem,n,m)){
	                int nin = (i+r)*W + (j-rem);
	                //int in = add_and({nin,cr});
	                vec.push_back(nin);
	            }
	            if(c(i-r,j-rem,n,m)){
	                int nin = (i-r)*W + (j-rem);
	                //int in = add_and({nin,cr});
	                vec.push_back(nin);
	                
	            }
	        }
	       // if(vec.size()%2==0){
	       //     vec.push_back(cr);
	       //     int ind1 = add_xor(vec);
	       //     vec.push_back(cr);
	       //     int ind2 = add_xor(vec);
	       // }else{
	       //     vec.push_back(cr);
	       //     vec.push_back(cr);
	       //     s.insert(vec);
	       // }
	        int ind1 = add_or(vec);
	        int ind2 = add_and({ind1,cr});
	        indexes.push_back(ind2);
	    }
	}
// 	for(auto z:s){
// 	    int i = add_xor(z);
// 	    indexes.push_back(i);
// 	}
	int f = add_or(indexes);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:62:6: warning: unused variable 'f' [-Wunused-variable]
   62 |  int f = add_or(indexes);
      |      ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 3 ms 984 KB Output is correct
4 Correct 13 ms 2008 KB Output is correct
5 Correct 8 ms 1496 KB Output is correct
6 Incorrect 1 ms 348 KB WA in grader: Instruction with no inputs
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1240 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -