제출 #1021547

#제출 시각아이디문제언어결과실행 시간메모리
1021547vjudge1Vision Program (IOI19_vision)C++17
8 / 100
1 ms348 KiB
#include "vision.h"
#include<vector>
#include<iostream>
using namespace std;

void construct_network(int H, int W, int K){
    int p;
    vector<int>t;
    for(int k=0;k<=K;k++)
        if(k<H&&(K-k)<W)t.push_back(k*W+(K-k));
    if(t.size()==1)p=t[0];
    else p=add_or(t);
    add_and({p,0});
}
#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...