oj.uz

Submission #952228

# Submission time Handle Problem Language Result Execution time Memory
952228 2024-03-23T10:14:14 Z arbuzick Ancient Machine 2 (JOI23_ancient2) C++17
98 / 100
 331 ms 1324 KB 
#include "ancient2.h"

#include <bits/stdc++.h>

using namespace std;

bitset<1001> bs[1000];

bool is_answer(int pos, int n) {
    for (int i = 0; i < pos; ++i) {
        for (int j = 0; j < n; ++j) {
            if (bs[i][j]) {
                if (bs[pos][j]) {
                    bs[pos] ^= bs[i];
                }
                break;
            }
        }
    }
    for (int j = 0; j < n; ++j) {
        if (bs[pos][j]) {
            for (int i = 0; i < pos; ++i) {
                if (bs[i][j]) {
                    bs[i] ^= bs[pos];
                }
            }
            return true;
        }
    }
    return false;
}

string get_answer(int n) {
    string ans = "";
    for (int i = 0; i < n; ++i) {
        int pos = -1;
        for (int j = i; j < n; ++j) {
            if (bs[j][i]) {
                pos = j;
                break;
            }
        }
        swap(bs[i], bs[pos]);
        for (int j = 0; j < n; ++j) {
            if (j != i && bs[j][i]) {
                bs[j] ^= bs[i];
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        ans += '0' + bs[i][n];
    }
    return ans;
}

string Solve(int n) {
    for (int i = 0; i < 100; ++i) {
        bs[i][i] = 1;
    }
    // for (int i = 0; i < 101; ++i) {
    //     bs[100 + i][n - i - 1] = 1;
    // }
    vector<pair<int, int>> qs;
    for (int a = 0; a < n; ++a) {
        for (int b = 1; b <= n; ++b) {
            if (a < b && b * 2 <= 108) {
                for (int i = 0; i < n; ++i) {
                    if (i >= a && i % b == a % b) {
                        bs[100 + qs.size()][i] = 1;
                    } else {
                        bs[100 + qs.size()][i] = 0;
                    }
                }
                if (is_answer(100 + qs.size(), n)) {
                    qs.emplace_back(a, b);
                }
            }
            if (qs.size() == n - 100) {
                break;
            }
        }
        if (qs.size() == n - 100) {
            break;
        }
    }
    // cout << "{";
    // for (int i = 0; i < n; ++i) {
    //     cout << "{" << qs[i].first << ", " << qs[i].second << "}";
    //     if (i + 1 < n) {
    //         cout << ", ";
    //     }
    // }
    // cout << "}";
    if (qs.size() != n - 100) {
        return "";
    }
    for (int i = 0; i < 100; ++i) {
        for (int j = 0; j < n; ++j) {
            if (j == i) {
                bs[i][j] = 1;
            } else {
                bs[i][j] = 0;
            }
        }
    }
    // for (int i = 0; i < 101; ++i) {
    //     for (int j = 0; j < n; ++j) {
    //         if (j == n - i - 1) {
    //             bs[100 + i][j] = 1;
    //         } else {
    //             bs[100 + i][j] = 0;
    //         }
    //     }
    // }
    for (int i = 0; i < (int)qs.size(); ++i) {
        for (int j = 0; j < n; ++j) {
            if (j >= qs[i].first && j % qs[i].second == qs[i].first % qs[i].second) {
                bs[100 + i][j] = 1;
            } else {
                bs[100 + i][j] = 0;
            }
        }
    }
    for (int i = 0; i < 100; ++i) {
        vector<int> a(i + 3), b(i + 3);
        for (int j = 0; j < i; ++j) {
            a[j] = j + 1;
            b[j] = j + 1;
        }
        a[i] = i + 1;
        b[i] = i + 2;
        a[i + 1] = b[i + 1] = i + 1;
        a[i + 2] = b[i + 2] = i + 2;
        int val = Query(i + 3, a, b);
        if (val == i + 1) {
            bs[i][n] = 0;
        } else {
            bs[i][n] = 1;
        }
    }
    for (int i = 0; i < (int)qs.size(); ++i) {
        vector<int> a(qs[i].second * 2), b(qs[i].second * 2);
        for (int j = 0; j < qs[i].second; ++j) {
            if (j + 1 == qs[i].second) {
                a[j] = b[j] = 0;
                a[qs[i].second + j] = b[qs[i].second + j] = qs[i].second;
            } else {
                a[j] = b[j] = j + 1;
                a[qs[i].second + j] = b[qs[i].second + j] = qs[i].second + j + 1;
            }
        }
        b[qs[i].first] += qs[i].second;
        b[qs[i].first + qs[i].second] -= qs[i].second;
        int val = Query(qs[i].second * 2, a, b);
        if (val < qs[i].second) {
            bs[100 + i][n] = 0;
        } else {
            bs[100 + i][n] = 1;
        }
    }
    return get_answer(n);
}

Compilation message

ancient2.cpp: In function 'std::string Solve(int)':
ancient2.cpp:78:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |             if (qs.size() == n - 100) {
      |                 ~~~~~~~~~~^~~~~~~~~~
ancient2.cpp:82:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   82 |         if (qs.size() == n - 100) {
      |             ~~~~~~~~~~^~~~~~~~~~
ancient2.cpp:94:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   94 |     if (qs.size() != n - 100) {
      |         ~~~~~~~~~~^~~~~~~~~~

Subtask #1
98.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 325 ms 824 KB Output is partially correct
2 Partially correct 322 ms 616 KB Output is partially correct
3 Partially correct 324 ms 808 KB Output is partially correct
4 Partially correct 320 ms 860 KB Output is partially correct
5 Partially correct 330 ms 916 KB Output is partially correct
6 Partially correct 322 ms 1072 KB Output is partially correct
7 Partially correct 326 ms 1052 KB Output is partially correct
8 Partially correct 322 ms 828 KB Output is partially correct
9 Partially correct 326 ms 872 KB Output is partially correct
10 Partially correct 325 ms 820 KB Output is partially correct
11 Partially correct 328 ms 824 KB Output is partially correct
12 Partially correct 323 ms 1076 KB Output is partially correct
13 Partially correct 327 ms 1068 KB Output is partially correct
14 Partially correct 322 ms 1076 KB Output is partially correct
15 Partially correct 325 ms 1012 KB Output is partially correct
16 Partially correct 321 ms 572 KB Output is partially correct
17 Partially correct 325 ms 1320 KB Output is partially correct
18 Partially correct 321 ms 820 KB Output is partially correct
19 Partially correct 324 ms 1324 KB Output is partially correct
20 Partially correct 321 ms 572 KB Output is partially correct
21 Partially correct 322 ms 868 KB Output is partially correct
22 Partially correct 325 ms 824 KB Output is partially correct
23 Partially correct 327 ms 1072 KB Output is partially correct
24 Partially correct 326 ms 820 KB Output is partially correct
25 Partially correct 325 ms 800 KB Output is partially correct
26 Partially correct 323 ms 816 KB Output is partially correct
27 Partially correct 322 ms 824 KB Output is partially correct
28 Partially correct 323 ms 820 KB Output is partially correct
29 Partially correct 330 ms 1072 KB Output is partially correct
30 Partially correct 321 ms 820 KB Output is partially correct
31 Partially correct 324 ms 1076 KB Output is partially correct
32 Partially correct 322 ms 828 KB Output is partially correct
33 Partially correct 322 ms 816 KB Output is partially correct
34 Partially correct 325 ms 764 KB Output is partially correct
35 Partially correct 321 ms 828 KB Output is partially correct
36 Partially correct 329 ms 1116 KB Output is partially correct
37 Partially correct 322 ms 820 KB Output is partially correct
38 Partially correct 331 ms 1060 KB Output is partially correct
39 Partially correct 321 ms 572 KB Output is partially correct
40 Partially correct 326 ms 848 KB Output is partially correct
41 Partially correct 324 ms 824 KB Output is partially correct
42 Partially correct 328 ms 908 KB Output is partially correct
43 Partially correct 324 ms 1000 KB Output is partially correct
44 Partially correct 325 ms 824 KB Output is partially correct
45 Partially correct 322 ms 784 KB Output is partially correct
46 Partially correct 326 ms 820 KB Output is partially correct
47 Partially correct 322 ms 1072 KB Output is partially correct
48 Partially correct 326 ms 820 KB Output is partially correct
49 Partially correct 326 ms 576 KB Output is partially correct
50 Partially correct 326 ms 820 KB Output is partially correct
51 Partially correct 322 ms 568 KB Output is partially correct
52 Partially correct 325 ms 1320 KB Output is partially correct
53 Partially correct 325 ms 592 KB Output is partially correct
54 Partially correct 323 ms 820 KB Output is partially correct
55 Partially correct 321 ms 784 KB Output is partially correct
56 Partially correct 322 ms 820 KB Output is partially correct
57 Partially correct 325 ms 1076 KB Output is partially correct
58 Partially correct 321 ms 820 KB Output is partially correct
59 Partially correct 330 ms 568 KB Output is partially correct
60 Partially correct 322 ms 1076 KB Output is partially correct
61 Partially correct 323 ms 824 KB Output is partially correct
62 Partially correct 329 ms 872 KB Output is partially correct
63 Partially correct 325 ms 1144 KB Output is partially correct