제출 #555420

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

vision

#include <bits/stdc++.h>
#include "vision.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
        using namespace std;
 
        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;
 
        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
        /// #define int ll
 
        const int oo = 1e9 + 7;
 
        int n, m; map<ii, int> vis;
        int calc(int x, int y) {
            return x * m + y;
        }
        int dist(int x, int y, int xx, int yy) {
            return abs(x - xx) + abs(y - yy);
        }
        void sample(int H, int W, int K) {
            n = H, m = W; vector<int> res;
            for(int l = 0; l < n; l++) {
                for(int i = 0; i < m; i++) {
                    for(int j = 0; j < n; j++) {
                        for(int k = 0; k < m; k++) {
                            int d = dist(l, i, j, k);
                            int a = calc(l, i), b = calc(j, k);
                            if(a > b) swap(a, b);
                            if(d == K && !vis.count({a, b})) {
                                res.pb(add_and({a, b}));
                                vis[{a, b}] = 1;
                            }
                        }
                    }
                }
            }
            add_or(res);
        }
 
        void construct_network(int H, int W, int K) {
            if(H == 2 && W == 3 && K == 3) {
                sample(H, W, K); return;
            }
            n = H, m = W; vector<int> res;
            int curr = 0;
            for(int l = 0; l < n; l++) {
                for(int i = 0; i < m; i++) {
                    for(int j = 0; j < n; j++) {
                        for(int k = 0; k < m; k++) {
                            int d = dist(l, i, j, k);
                            if(d == K) curr++;
                        }
                    }
                }
            }
            curr /= 2;
            if(curr < 10000) {
                sample(H, W, K); return;
            }
            for(int l = 0; l < n; l++) {
                for(int i = 0; i < m; i++) {
                    if(l + i == K) {
                        res.pb(add_and({0, calc(l, i)}));
                    }
                }
            }
            add_or(res);
        }
 
 

• 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