oj.uz

Submission #573062

# Submission time Handle Problem Language Result Execution time Memory
573062 2022-06-05T17:13:01 Z MadokaMagicaFan Vision Program (IOI19_vision) C++14
100 / 100
 19 ms 1744 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
const ll inf = 1e9;
const int md1 = 1e9+7;
const int md2 = 998244353;

#define all(v)                      v.begin(), v.end()
#define rall(v)                     v.rbegin(), v.rend()
#define sz(v)                       ((int)v.size())

#define forn(i,n)                   for(int i = 0; i < n; ++i)
#define forbe(i,b,e)                for(int i = b; i < e; ++i)

#define pb                          push_back

#define pry                         puts("YES")
#define prn                         puts("NO")
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int K = 10;

int add_not(int N);
int add_and(vector<int> s);
int add_or(vector<int> s);
int add_xor(vector<int> s);

#ifdef ONPC
int cnt1, cnt2;

vector<int> table;


int 
add_not(int N)
{
    ++cnt1;
    ++cnt2;
    assert(N<sz(table));
    if (table[N])
        table.pb(0);
    else
        table.pb(1);
    return sz(table)-1;
}

int
add_and(vector<int> s)
{
    int ans = 0;
    ++cnt1;
    cnt2 += sz(s);
    for (int i = 0; i < sz(s); ++i)
        assert(s[i] < sz(table));
    for (int i = 0; i < sz(s); ++i)
        ans += table[s[i]];
    if (ans==sz(s))
        table.pb(1);
    else
        table.pb(0);
    return sz(table)-1;
}

int
add_or(vector<int> s)
{
    int ans = 0;
    ++cnt1;
    cnt2 += sz(s);
    for (int i = 0; i < sz(s); ++i)
        assert(s[i] < sz(table));
    for (int i = 0; i < sz(s); ++i)
        ans += table[s[i]];
    if (ans>0)
        table.pb(1);
    else
        table.pb(0);
    return sz(table)-1;
}

int
add_xor(vector<int> s)
{
    int ans = 0;
    ++cnt1;
    cnt2 += sz(s);
    for (int i = 0; i < sz(s); ++i)
        assert(s[i] < sz(table));
    for (int i = 0; i < sz(s); ++i)
        ans += table[s[i]];
    if (ans&1)
        table.pb(1);
    else
        table.pb(0);
    return sz(table)-1;
}
#endif

void
construct_network(int h, int w, int k)
{
    vector<int> rowOR(h);
    vector<int> colOR(w);
    vector<int> bitx(K);
    vector<int> bity(K);
    vector<int> bitans(K);
    int zero;
    int z = 0;
    int u1,u2,u3,u4;

    vector<int> q;
    vector<int> lastq;
    vector<int> bigq;

    q.resize(w);
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            q[j] = i * w + j;
        }
        rowOR[i] = add_xor(q);
    }

    q.resize(h);
    for (int i = 0; i < w; ++i) {
        for (int j = 0; j < h; ++j) {
            q[j] = j * w + i;
        }
        colOR[i] = add_xor(q);
    }

    if (w * h > 2)
        zero = add_and({0,1,2});
    else
        zero = add_not(0);

    for (int i = 0; i < K; ++i) {
        bitx[i] = zero;
        bity[i] = zero;
    }

    /* Get y height */
    q.clear();
    for (int i = 0; i < h; ++i) {
        q.pb(rowOR[i]);
        bigq.pb(add_xor(q));
    }
    z = 0;
    while (1) {
        assert(z<10);
        q = bigq;
        /* cout << "y " << z << ": "; */
        /* for (int u : q) */
        /*     cout << table[u]; */
        /* cout << endl; */
        bity[z] = add_xor(q);
        if (q.size() == 1)
            break;
        bigq.clear();
        for (int i = 0; i < sz(q)-1; i+=2) {
            u1 = add_and({q[i],q[i+1]});
            u2 = add_xor({q[i],q[i+1],bity[z]});
            u3 = add_and({u2,q[i+1]});
            bigq.pb(add_or({u1,u3}));
        }
        ++z;
    }

    /* Get x height */
    q.clear();
    bigq.clear();
    for (int i = 0; i < w; ++i) {
        q.pb(colOR[i]);
        bigq.pb(add_xor(q));
    }
    z = 0;
    while (1) {
        assert(z<10);
        q = bigq;
        /* cout << "x " << z << ": "; */
        /* for (int u : q) */
        /*     cout << table[u]; */
        /* cout << endl; */
        bitx[z] = add_xor(q);
        if (q.size() == 1)
            break;
        bigq.clear();
        for (int i = 0; i < sz(q)-1; i+=2) {
            u1 = add_and({q[i],q[i+1]});
            u2 = add_xor({q[i],q[i+1],bitx[z]});
            u3 = add_and({u2,q[i+1]});
            bigq.pb(add_or({u1,u3}));
        }
        ++z;
    }

    /* for (int i = K-1; i >= 0; --i) cout << table[bitx[i]]; */
    /* cout << endl; */
    /* for (int i = K-1; i >= 0; --i) cout << table[bity[i]]; */
    /* cout << endl; */

    /* Do sum */
    int lbit = zero;

    for (int i = 0; i < K; ++i) {
        bitans[i] = add_xor({lbit,bitx[i],bity[i]});
        u1 = add_and({bitx[i],bity[i]});
        u2 = add_and({bitx[i],lbit});
        u3 = add_and({bity[i],lbit});
        lbit = add_or({u1,u2,u3});
        if ((k&(1<<i))==0) {
            bitans[i] = add_not(bitans[i]);
        }
    }

    add_and(bitans);

    return;
}

#ifdef ONPC
void
generate()
{
    int h = 3;
    int w = 3;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            table.pb(0);
        }
    }
    table[0] = 1;
    table[2] = 1;

    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            cout << table[i*w+j];
        }
        cout << endl;
    }

    return;
}

void
solve()
{
    generate();
    construct_network(3,3,2);
    cout << table[sz(table)-1] << endl;
    cout << cnt1 << ' ' << cnt2 << endl;
}

int32_t
main()
{
    int t = 1;
    /* cin >> t; */
    while(t--)
        solve();
}
#endif

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:114:18: warning: unused variable 'u4' [-Wunused-variable]
  114 |     int u1,u2,u3,u4;
      |                  ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 688 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 428 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 4 ms 596 KB Output is correct
46 Correct 4 ms 596 KB Output is correct
47 Correct 4 ms 596 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 548 KB Output is correct
14 Correct 3 ms 556 KB Output is correct
15 Correct 3 ms 556 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 552 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 3 ms 428 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 580 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 7 ms 1068 KB Output is correct
21 Correct 7 ms 1064 KB Output is correct
22 Correct 7 ms 980 KB Output is correct
23 Correct 11 ms 1072 KB Output is correct
24 Correct 7 ms 988 KB Output is correct
25 Correct 8 ms 980 KB Output is correct
26 Correct 8 ms 980 KB Output is correct
27 Correct 13 ms 1620 KB Output is correct
28 Correct 13 ms 1708 KB Output is correct
29 Correct 12 ms 1624 KB Output is correct
30 Correct 13 ms 1728 KB Output is correct
31 Correct 14 ms 1632 KB Output is correct
32 Correct 0 ms 300 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1648 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 7 ms 1068 KB Output is correct
8 Correct 7 ms 1068 KB Output is correct
9 Correct 12 ms 1708 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 688 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 428 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 4 ms 596 KB Output is correct
46 Correct 4 ms 596 KB Output is correct
47 Correct 4 ms 596 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 3 ms 596 KB Output is correct
51 Correct 3 ms 520 KB Output is correct
52 Correct 4 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 3 ms 548 KB Output is correct
61 Correct 3 ms 556 KB Output is correct
62 Correct 3 ms 556 KB Output is correct
63 Correct 3 ms 596 KB Output is correct
64 Correct 3 ms 556 KB Output is correct
65 Correct 3 ms 596 KB Output is correct
66 Correct 3 ms 552 KB Output is correct
67 Correct 3 ms 596 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 3 ms 428 KB Output is correct
74 Correct 2 ms 428 KB Output is correct
75 Correct 3 ms 428 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 596 KB Output is correct
78 Correct 3 ms 596 KB Output is correct
79 Correct 3 ms 596 KB Output is correct
80 Correct 3 ms 556 KB Output is correct
81 Correct 3 ms 596 KB Output is correct
82 Correct 3 ms 580 KB Output is correct
83 Correct 3 ms 596 KB Output is correct
84 Correct 3 ms 596 KB Output is correct
85 Correct 3 ms 596 KB Output is correct
86 Correct 3 ms 596 KB Output is correct
87 Correct 4 ms 596 KB Output is correct
88 Correct 3 ms 596 KB Output is correct
89 Correct 7 ms 1068 KB Output is correct
90 Correct 7 ms 1064 KB Output is correct
91 Correct 7 ms 980 KB Output is correct
92 Correct 11 ms 1072 KB Output is correct
93 Correct 7 ms 988 KB Output is correct
94 Correct 8 ms 980 KB Output is correct
95 Correct 8 ms 980 KB Output is correct
96 Correct 13 ms 1620 KB Output is correct
97 Correct 13 ms 1708 KB Output is correct
98 Correct 12 ms 1624 KB Output is correct
99 Correct 13 ms 1728 KB Output is correct
100 Correct 14 ms 1632 KB Output is correct
101 Correct 0 ms 300 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 12 ms 1648 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 2 ms 340 KB Output is correct
106 Correct 3 ms 596 KB Output is correct
107 Correct 3 ms 596 KB Output is correct
108 Correct 3 ms 596 KB Output is correct
109 Correct 7 ms 1068 KB Output is correct
110 Correct 7 ms 1068 KB Output is correct
111 Correct 12 ms 1708 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 13 ms 1620 KB Output is correct
115 Correct 3 ms 596 KB Output is correct
116 Correct 3 ms 596 KB Output is correct
117 Correct 8 ms 988 KB Output is correct
118 Correct 7 ms 980 KB Output is correct
119 Correct 14 ms 1696 KB Output is correct
120 Correct 12 ms 1640 KB Output is correct
121 Correct 19 ms 1712 KB Output is correct
122 Correct 14 ms 1624 KB Output is correct
123 Correct 12 ms 1744 KB Output is correct
124 Correct 12 ms 1620 KB Output is correct
125 Correct 12 ms 1616 KB Output is correct
126 Correct 12 ms 1612 KB Output is correct
127 Correct 12 ms 1620 KB Output is correct
128 Correct 12 ms 1684 KB Output is correct