제출 #1221694

#제출 시각아이디문제언어결과실행 시간메모리
1221694VMaksimoski008Vision Program (IOI19_vision)C++20
0 / 100
6 ms1352 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; int id[205][205], c = 0; void construct_network(int n, int m, int k) { for(int i=0; i<n; i++) for(int j=0; j<m; j++) id[i][j] = c++; //(0, 0) e crno vector<int> row; for(int i=0; i<n; i++) { vector<int> v; for(int j=0; j<m; j++) v.push_back(id[i][j]); row.push_back(add_or(v)); } vector<int> col; for(int j=0; j<m; j++) { vector<int> v; for(int i=0; i<n; i++) v.push_back(id[i][j]); col.push_back(add_or(v)); } vector<int> res; for(int i=0; i<n; i++) if(k-i < m) res.push_back(add_and({ row[i], col[k-i] })); add_or(res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...