oj.uz

답안 #349096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349096 2021-01-16T16:39:43 Z ACmachine Vision Program (IOI19_vision) C++17
100 / 100
 70 ms 5992 KB 
#include "vision.h"

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

int solve_x(int h, int w, int k){
    // 2 diagonals
    vector<vi> diag1(h + w + 5); // (r + a, c + a); d = r - c; -> cmax = w - 1; -> offset = w - 1;
    vector<vi> diag2(h + w + 5); // (r + a, c - a); d = r + c; 
    REP(i, h){
        REP(j, w){
            diag1[i - j + w - 1].pb(i * w + j);
            diag2[i + j].pb(i * w + j);
        }
    }
    vi diag1_res;
    vi diag2_res;
    REP(i, h + w + 4){
        if(diag1[i].empty()) continue;
        diag1_res.pb(add_or(diag1[i]));
    }
    REP(i, h + w + 4){
        if(diag2[i].empty()) continue;
        diag2_res.pb(add_or(diag2[i]));
    } 
    vi sliding1;
    vi sliding2;
    REP(i, (int)diag1_res.size() - k){
        vi curr;
        REP(j, k + 1){
            curr.pb(diag1_res[i + j]);
        }
        int op1 = add_or(curr);
        int op2 = add_xor(curr);
        int op3 = add_not(op2);
        int re = add_and({op1, op3});
        sliding1.pb(re);
    }
    REP(i, (int)diag2_res.size() - k){
        vi curr;
        REP(j, k + 1){
            curr.pb(diag2_res[i + j]);
        }
        int op1 = add_or(curr);
        int op2 = add_xor(curr);
        int op3 = add_not(op2);
        int re = add_and({op1, op3});
        sliding2.pb(re);
    }
    vi curr;
    int on1 = add_xor(diag1_res);
    int on2 = add_xor(diag2_res);
    int iswith1 = add_or(sliding1);
    int iswith2 = add_or(sliding2);
    int res1 = add_or({on1, iswith1});
    int res2 = add_or({on2, iswith2});
    return add_and({res1, res2}); 
}
void construct_network(int H, int W, int K) {
    if(K == 1){
        solve_x(H,W, K);        
    }
    else{
        add_xor({solve_x(H, W, K), solve_x(H, W, K - 1)});
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 492 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 2 ms 364 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 492 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 14 ms 1644 KB Output is correct
39 Correct 3 ms 620 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 5 ms 876 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 4 ms 748 KB Output is correct
44 Correct 14 ms 1644 KB Output is correct
45 Correct 16 ms 1772 KB Output is correct
46 Correct 14 ms 1516 KB Output is correct
47 Correct 6 ms 876 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 11 ms 1132 KB Output is correct
3 Correct 11 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 10 ms 1132 KB Output is correct
7 Correct 14 ms 1136 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 9 ms 1132 KB Output is correct
11 Correct 11 ms 1260 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 8 ms 1024 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 9 ms 1132 KB Output is correct
17 Correct 11 ms 1260 KB Output is correct
18 Correct 11 ms 1260 KB Output is correct
19 Correct 8 ms 1004 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 9 ms 876 KB Output is correct
6 Correct 7 ms 748 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 13 ms 1260 KB Output is correct
10 Correct 16 ms 1388 KB Output is correct
11 Correct 10 ms 1132 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 10 ms 1132 KB Output is correct
15 Correct 11 ms 1004 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 11 ms 1132 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 7 ms 1132 KB Output is correct
21 Correct 31 ms 3176 KB Output is correct
22 Correct 30 ms 3052 KB Output is correct
23 Correct 12 ms 1388 KB Output is correct
24 Correct 7 ms 1132 KB Output is correct
25 Correct 33 ms 3308 KB Output is correct
26 Correct 12 ms 1388 KB Output is correct
27 Correct 13 ms 1900 KB Output is correct
28 Correct 52 ms 5196 KB Output is correct
29 Correct 59 ms 5884 KB Output is correct
30 Correct 50 ms 4992 KB Output is correct
31 Correct 22 ms 2540 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1900 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 9 ms 1132 KB Output is correct
8 Correct 7 ms 1164 KB Output is correct
9 Correct 13 ms 1900 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 492 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 2 ms 492 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 14 ms 1644 KB Output is correct
39 Correct 3 ms 620 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 5 ms 876 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 4 ms 748 KB Output is correct
44 Correct 14 ms 1644 KB Output is correct
45 Correct 16 ms 1772 KB Output is correct
46 Correct 14 ms 1516 KB Output is correct
47 Correct 6 ms 876 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 11 ms 1132 KB Output is correct
50 Correct 11 ms 1132 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 3 ms 620 KB Output is correct
53 Correct 10 ms 1132 KB Output is correct
54 Correct 14 ms 1136 KB Output is correct
55 Correct 1 ms 492 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 9 ms 1132 KB Output is correct
58 Correct 11 ms 1260 KB Output is correct
59 Correct 11 ms 1260 KB Output is correct
60 Correct 8 ms 1024 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 2 ms 492 KB Output is correct
63 Correct 9 ms 1132 KB Output is correct
64 Correct 11 ms 1260 KB Output is correct
65 Correct 11 ms 1260 KB Output is correct
66 Correct 8 ms 1004 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 2 ms 492 KB Output is correct
73 Correct 6 ms 876 KB Output is correct
74 Correct 9 ms 876 KB Output is correct
75 Correct 7 ms 748 KB Output is correct
76 Correct 3 ms 492 KB Output is correct
77 Correct 3 ms 620 KB Output is correct
78 Correct 13 ms 1260 KB Output is correct
79 Correct 16 ms 1388 KB Output is correct
80 Correct 10 ms 1132 KB Output is correct
81 Correct 4 ms 620 KB Output is correct
82 Correct 2 ms 492 KB Output is correct
83 Correct 10 ms 1132 KB Output is correct
84 Correct 11 ms 1004 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 2 ms 492 KB Output is correct
87 Correct 11 ms 1132 KB Output is correct
88 Correct 2 ms 364 KB Output is correct
89 Correct 7 ms 1132 KB Output is correct
90 Correct 31 ms 3176 KB Output is correct
91 Correct 30 ms 3052 KB Output is correct
92 Correct 12 ms 1388 KB Output is correct
93 Correct 7 ms 1132 KB Output is correct
94 Correct 33 ms 3308 KB Output is correct
95 Correct 12 ms 1388 KB Output is correct
96 Correct 13 ms 1900 KB Output is correct
97 Correct 52 ms 5196 KB Output is correct
98 Correct 59 ms 5884 KB Output is correct
99 Correct 50 ms 4992 KB Output is correct
100 Correct 22 ms 2540 KB Output is correct
101 Correct 1 ms 364 KB Output is correct
102 Correct 1 ms 364 KB Output is correct
103 Correct 17 ms 1900 KB Output is correct
104 Correct 1 ms 364 KB Output is correct
105 Correct 3 ms 492 KB Output is correct
106 Correct 3 ms 620 KB Output is correct
107 Correct 2 ms 492 KB Output is correct
108 Correct 2 ms 492 KB Output is correct
109 Correct 9 ms 1132 KB Output is correct
110 Correct 7 ms 1164 KB Output is correct
111 Correct 13 ms 1900 KB Output is correct
112 Correct 0 ms 364 KB Output is correct
113 Correct 1 ms 364 KB Output is correct
114 Correct 51 ms 5224 KB Output is correct
115 Correct 2 ms 492 KB Output is correct
116 Correct 3 ms 620 KB Output is correct
117 Correct 23 ms 2412 KB Output is correct
118 Correct 25 ms 2664 KB Output is correct
119 Correct 59 ms 5864 KB Output is correct
120 Correct 70 ms 5864 KB Output is correct
121 Correct 60 ms 5864 KB Output is correct
122 Correct 59 ms 5864 KB Output is correct
123 Correct 13 ms 1900 KB Output is correct
124 Correct 54 ms 5352 KB Output is correct
125 Correct 60 ms 5992 KB Output is correct
126 Correct 60 ms 5864 KB Output is correct
127 Correct 49 ms 4972 KB Output is correct
128 Correct 22 ms 2540 KB Output is correct