제출 #922443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922443		Warinchai	Vision Program (IOI19_vision)	C++14	33 / 100	1065 ms	194132 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
int dis(int i,int j,int x,int y){
    return (abs(i-x)+abs(j-y));
}
vector<int>v;
map<pair<pair<int,int>,pair<int,int>>,int>mp;
void construct_network(int H, int W, int K) {
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            for(int i2=0;i2<H;i2++){
                for(int j2=0;j2<W;j2++){
                    if(mp[{{i,j},{i2,j2}}]||mp[{{i2,j2},{i,j}}])continue;
                    mp[{{i,j},{i2,j2}}]++;
                    mp[{{i2,j2},{i,j}}]++;
                    if(dis(i,j,i2,j2)==K){
                        v.push_back(add_and({i*W+j,i2*W+j2}));
                    }
                }
            }
        }
    }
    add_or(v);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19