# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
979036 | simuyu | Vision Program (IOI19_vision) | C++14 | 3 ms | 604 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
//vector<int> Ns;
//Ns = {0, 1};
//int a = add_and(Ns);
// st1 or maybe 2??
vector<int> st2ONs, st2INs;
if (max(H,W) <= 30) {
for (int mh=0; mh<H; mh++) {
for (int mw=0; mw<W; mw++) {
// middle is mh, mw
// note that this is only true if (mh*W + mw) is true yea.
// try four sides surround with K.
st2INs.clear(); // jic
for (int i=0; i<=K; i++) {
// try adding from all 4 directions
if ( ((0 <= mh-i) && (mh-i < H)) && ((0 <= mw-(K-i)) && (mw-(K-i) < W)) ) st2INs.push_back( (mh-i)*W + (mw-(K-i)) );
if ((K-i) != 0)
if ( ((0 <= mh-i) && (mh-i < H)) && ((0 <= mw+(K-i)) && (mw+(K-i) < W)) ) st2INs.push_back( (mh-i)*W + (mw+(K-i)) );
if (i!=0) {
if ( ((0 <= mh+i) && (mh+i < H)) && ((0 <= mw-(K-i)) && (mw-(K-i) < W)) ) st2INs.push_back( (mh+i)*W + (mw-(K-i)) );
if ((K-i) != 0)
if ( ((0 <= mh+i) && (mh+i < H)) && ((0 <= mw+(K-i)) && (mw+(K-i) < W)) ) st2INs.push_back( (mh+i)*W + (mw+(K-i)) );
}
}
if (st2INs.size() == 0) continue;
int mor = add_or(st2INs); // either of them are yes
int can = add_and( {mor, (mh*W + mw)} ); // and the initial condition was true also
st2ONs.push_back(can);
/*cout << '(' << mh << ',' << mw << "): ";
for (int i=0; i<st2INs.size(); i++) {
cout << '(' << st2INs[i]/W << ',' << st2INs[i]%W << ") ";
}
cout << endl;*/
}
}
int st2 = add_or(st2ONs); // if any of those cases were fulfilled
} else {
// st6
vector<int> st6Ns;
for (int i=0; i<=K; i++) {
// i is row, K-i is column.
if ((i>=H) || (K-i >= W)) continue; // if invalid index
//cout << "(" << i << "," << K-i << ")" << endl;
st6Ns.push_back( i*W + (K-i) );
}
int st6 = add_or(st6Ns);
st6Ns.clear();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |