oj.uz

답안 #403320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403320 2021-05-13T03:36:07 Z balbit Vision Program (IOI19_vision) C++14
100 / 100
 16 ms 1872 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;

int n, m;

int id(int i, int j) {
    return i*m+j;
}

vector<int> dia1[200+200+5], dia2[200+200+5];
int d1and(int x) {
    return n*m+x;
}
int d2and(int x) {
    return n*m+n+m-1+x;
}
vector<int> d1pl, d1pr, d2pl, d2pr;

//int add_or(vector<int> x) {
//
//}
//int add_and(vector<int> x) {
//
//}
//int add_xor(vector<int> x) {
//
//}
//int add_not(int x) {
//
//}

void construct_network(int _n, int _m, int K) {
    n=_n; m=_m;
    REP(i,n) REP(j,m) {
        dia1[i+j].pb(id(i,j));
        dia2[i+m-1-j].pb(id(i,j));
    }
    REP(i,n+m-1) {
        add_or(dia1[i]);
    }
    REP(i,n+m-1) {
        add_or(dia2[i]);
    }
    {
        int lst = -1;
        REP(i,n+m-1) {
            if (lst == -1) {
                lst = add_or({d1and(i)});
            }else{
                lst = add_or({lst, d1and(i)});
            }
            d1pl.pb(lst);
        }
    }
    {
        int lst = -1;
        RREP(i,n+m-1) {
            if (lst == -1) {
                lst = add_or({d1and(i)});
            }else{
                lst = add_or({lst, d1and(i)});
            }
            d1pr.pb(lst);
        }
        reverse(ALL(d1pr));
    }
    {
        int lst = -1;
        REP(i,n+m-1) {
            if (lst == -1) {
                lst = add_or({d2and(i)});
            }else{
                lst = add_or({lst, d2and(i)});
            }
            d2pl.pb(lst);
        }
    }
    {
        int lst = -1;
        RREP(i,n+m-1) {
            if (lst == -1) {
                lst = add_or({d2and(i)});
            }else{
                lst = add_or({lst, d2and(i)});
            }
            d2pr.pb(lst);
        }
        reverse(ALL(d2pr));
    }
    vector<int> tmp1;
    REP(i, n+m-K-1) {
        tmp1.pb(add_and({d1and(i), d1and(i+K)}));
    }
    int anydia1 = add_or(tmp1);
    vector<int> tmp2;
    REP(i, n+m-K-1) {
        tmp2.pb(add_and({d2and(i), d2and(i+K)}));
    }
//    return;
    int anydia2 = add_or(tmp2);
    int anybad1, anybad2;
    {
        vector<int> g1;
        REP(i,n+m) {
            if (i+K+1 < n+m-1) {
                g1.pb(add_and({d1pl[i], d1pr[i+K+1]}));
            }
        }
        anybad1 = SZ(g1)==0?-1:add_or(g1);
    }
    {
        vector<int> g2;
        REP(i,n+m) {
            if (i+K+1 < n+m-1) {
                g2.pb(add_and({d2pl[i], d2pr[i+K+1]}));
            }
        }
        anybad2 = SZ(g2)==0?-1:add_or(g2);
    }
    if (anybad1 == -1) {
        int ans = add_or({anydia1, anydia2});
    }else{
        int nobad1 = add_not(anybad1);
        int nobad2 = add_not(anybad2);
        int ok1 = add_and({anydia1, nobad2});
        int ok2 = add_and({anydia2, nobad1});
        int ans = add_or({ok1, ok2});
    }
}

//
//signed main(){
//    IOS();
//
//
//}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:172:13: warning: unused variable 'ans' [-Wunused-variable]
  172 |         int ans = add_or({anydia1, anydia2});
      |             ^~~
vision.cpp:178:13: warning: unused variable 'ans' [-Wunused-variable]
  178 |         int ans = add_or({ok1, ok2});
      |             ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 316 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 312 KB Output is correct
38 Correct 5 ms 716 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 1 ms 316 KB Output is correct
41 Correct 3 ms 572 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 4 ms 676 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 4 ms 716 KB Output is correct
47 Correct 5 ms 716 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 440 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 440 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 7 ms 1100 KB Output is correct
21 Correct 7 ms 1128 KB Output is correct
22 Correct 7 ms 1100 KB Output is correct
23 Correct 7 ms 1008 KB Output is correct
24 Correct 10 ms 1100 KB Output is correct
25 Correct 7 ms 1100 KB Output is correct
26 Correct 8 ms 972 KB Output is correct
27 Correct 13 ms 1808 KB Output is correct
28 Correct 16 ms 1864 KB Output is correct
29 Correct 12 ms 1740 KB Output is correct
30 Correct 12 ms 1784 KB Output is correct
31 Correct 15 ms 1740 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1872 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 440 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 7 ms 1100 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 13 ms 1864 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 316 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 312 KB Output is correct
38 Correct 5 ms 716 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 1 ms 316 KB Output is correct
41 Correct 3 ms 572 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 4 ms 676 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 4 ms 716 KB Output is correct
47 Correct 5 ms 716 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 2 ms 460 KB Output is correct
51 Correct 1 ms 436 KB Output is correct
52 Correct 2 ms 460 KB Output is correct
53 Correct 2 ms 460 KB Output is correct
54 Correct 2 ms 460 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 2 ms 440 KB Output is correct
59 Correct 2 ms 460 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 460 KB Output is correct
63 Correct 2 ms 460 KB Output is correct
64 Correct 2 ms 460 KB Output is correct
65 Correct 2 ms 460 KB Output is correct
66 Correct 2 ms 460 KB Output is correct
67 Correct 2 ms 332 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 2 ms 400 KB Output is correct
73 Correct 2 ms 460 KB Output is correct
74 Correct 2 ms 440 KB Output is correct
75 Correct 2 ms 460 KB Output is correct
76 Correct 2 ms 332 KB Output is correct
77 Correct 3 ms 588 KB Output is correct
78 Correct 4 ms 588 KB Output is correct
79 Correct 3 ms 588 KB Output is correct
80 Correct 4 ms 588 KB Output is correct
81 Correct 3 ms 588 KB Output is correct
82 Correct 2 ms 460 KB Output is correct
83 Correct 2 ms 460 KB Output is correct
84 Correct 2 ms 332 KB Output is correct
85 Correct 2 ms 332 KB Output is correct
86 Correct 2 ms 440 KB Output is correct
87 Correct 3 ms 460 KB Output is correct
88 Correct 2 ms 332 KB Output is correct
89 Correct 7 ms 1100 KB Output is correct
90 Correct 7 ms 1128 KB Output is correct
91 Correct 7 ms 1100 KB Output is correct
92 Correct 7 ms 1008 KB Output is correct
93 Correct 10 ms 1100 KB Output is correct
94 Correct 7 ms 1100 KB Output is correct
95 Correct 8 ms 972 KB Output is correct
96 Correct 13 ms 1808 KB Output is correct
97 Correct 16 ms 1864 KB Output is correct
98 Correct 12 ms 1740 KB Output is correct
99 Correct 12 ms 1784 KB Output is correct
100 Correct 15 ms 1740 KB Output is correct
101 Correct 1 ms 204 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 13 ms 1872 KB Output is correct
104 Correct 1 ms 312 KB Output is correct
105 Correct 2 ms 460 KB Output is correct
106 Correct 3 ms 588 KB Output is correct
107 Correct 3 ms 440 KB Output is correct
108 Correct 3 ms 460 KB Output is correct
109 Correct 7 ms 1100 KB Output is correct
110 Correct 7 ms 1100 KB Output is correct
111 Correct 13 ms 1864 KB Output is correct
112 Correct 1 ms 204 KB Output is correct
113 Correct 1 ms 204 KB Output is correct
114 Correct 12 ms 1868 KB Output is correct
115 Correct 2 ms 444 KB Output is correct
116 Correct 2 ms 460 KB Output is correct
117 Correct 8 ms 972 KB Output is correct
118 Correct 7 ms 1100 KB Output is correct
119 Correct 14 ms 1788 KB Output is correct
120 Correct 12 ms 1740 KB Output is correct
121 Correct 12 ms 1756 KB Output is correct
122 Correct 12 ms 1740 KB Output is correct
123 Correct 13 ms 1868 KB Output is correct
124 Correct 13 ms 1832 KB Output is correct
125 Correct 12 ms 1864 KB Output is correct
126 Correct 12 ms 1748 KB Output is correct
127 Correct 16 ms 1740 KB Output is correct
128 Correct 12 ms 1740 KB Output is correct