제출 #572901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572901		SlavicG	Vision Program (IOI19_vision)	C++17	29 / 100	9 ms	1872 KiB

vision

#include "vision.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
/*
int add_not(int N){}
int add_and(vector<int> Ns){}
int add_or(vector<int> Ns){}
int add_xor(vector<int> Ns){}
*/
 
void construct_network(int H, int W, int K) {
    vector<int> indices;
    
    if(H <= 100 && W <= 100) {
        set<array<int, 4>> vis;
        for(int i = 0; i < H; ++i) {
            for(int j = 0; j < W; ++j) {
                for(int x = 0; x < H; ++x) {
                    for(int y = 0; y < W; ++y) {
                        if(x == i && j == y) continue;
                        if(abs(x - i) + abs(y - j) != K) continue;
                        vis.insert({i, j, x, y});
                        vis.insert({x, y, i, j});
                        vector<int> purice = {i * W + j, x * W + y};
                        sort(all(purice));
                        indices.pb(add_and(purice));
                    }   
                }
            }
        }
        if(sz(indices) == 0) {
            vector<int> bruh;
            for(int i = 0; i < H * W; ++i) bruh.pb(i);
            add_and(bruh);
            return;
        }
        add_or(indices);
        return;
    } else {
        vector<int> Paiu;
        for(int i = 0; i < H; ++i) {
            for(int j = 0; j < W; ++j) {
                if(i + j != K) continue;
                if(i == 0 && j == 0) continue;
                Paiu.pb(add_and({0, i * W + j}));
            }
        }
        add_or(Paiu);
        return;
    }
}
/*
void solve() {  
    
} 
     
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}   

*/

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