답안 #952211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
952211	2024-03-23T09:51:31 Z	arbuzick	Ancient Machine 2 (JOI23_ancient2)	C++17	97 / 100	353 ms	1272 KB

ancient2

#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) {
    vector<pair<int, int>> qs;
    for (int a = 0; a < n; ++a) {
        for (int b = 1; b <= n; ++b) {
            if (a < b && b * 2 <= 114) {
                for (int i = 0; i < n; ++i) {
                    if (i >= a && i % b == a % b) {
                        bs[qs.size()][i] = 1;
                    } else {
                        bs[qs.size()][i] = 0;
                    }
                }
                if (is_answer(qs.size(), n)) {
                    qs.emplace_back(a, b);
                }
            }
            if (qs.size() == n) {
                break;
            }
        }
        if (qs.size() == n) {
            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) {
        return "";
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (j >= qs[i].first && j % qs[i].second == qs[i].first % qs[i].second) {
                bs[i][j] = 1;
            } else {
                bs[i][j] = 0;
            }
        }
    }
    for (int i = 0; i < n; ++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[i][n] = 0;
        } else {
            bs[i][n] = 1;
        }
    }
    return get_answer(n);
}

Compilation message

ancient2.cpp: In function 'std::string Solve(int)':
ancient2.cpp:72: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]
   72 |             if (qs.size() == n) {
      |                 ~~~~~~~~~~^~~~
ancient2.cpp:76: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]
   76 |         if (qs.size() == n) {
      |             ~~~~~~~~~~^~~~
ancient2.cpp:88: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]
   88 |     if (qs.size() != n) {
      |         ~~~~~~~~~~^~~~

Subtask #1

97.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	304 ms	824 KB	Output is partially correct
2	Partially correct	300 ms	824 KB	Output is partially correct
3	Partially correct	314 ms	820 KB	Output is partially correct
4	Partially correct	302 ms	868 KB	Output is partially correct
5	Partially correct	305 ms	1036 KB	Output is partially correct
6	Partially correct	300 ms	828 KB	Output is partially correct
7	Partially correct	309 ms	572 KB	Output is partially correct
8	Partially correct	301 ms	828 KB	Output is partially correct
9	Partially correct	303 ms	820 KB	Output is partially correct
10	Partially correct	300 ms	828 KB	Output is partially correct
11	Partially correct	303 ms	820 KB	Output is partially correct
12	Partially correct	305 ms	828 KB	Output is partially correct
13	Partially correct	301 ms	816 KB	Output is partially correct
14	Partially correct	306 ms	828 KB	Output is partially correct
15	Partially correct	303 ms	824 KB	Output is partially correct
16	Partially correct	311 ms	756 KB	Output is partially correct
17	Partially correct	311 ms	820 KB	Output is partially correct
18	Partially correct	306 ms	804 KB	Output is partially correct
19	Partially correct	317 ms	824 KB	Output is partially correct
20	Partially correct	322 ms	576 KB	Output is partially correct
21	Partially correct	304 ms	568 KB	Output is partially correct
22	Partially correct	314 ms	612 KB	Output is partially correct
23	Partially correct	307 ms	752 KB	Output is partially correct
24	Partially correct	335 ms	820 KB	Output is partially correct
25	Partially correct	308 ms	592 KB	Output is partially correct
26	Partially correct	327 ms	568 KB	Output is partially correct
27	Partially correct	330 ms	816 KB	Output is partially correct
28	Partially correct	314 ms	824 KB	Output is partially correct
29	Partially correct	302 ms	780 KB	Output is partially correct
30	Partially correct	312 ms	824 KB	Output is partially correct
31	Partially correct	305 ms	1076 KB	Output is partially correct
32	Partially correct	308 ms	820 KB	Output is partially correct
33	Partially correct	305 ms	864 KB	Output is partially correct
34	Partially correct	308 ms	816 KB	Output is partially correct
35	Partially correct	312 ms	828 KB	Output is partially correct
36	Partially correct	317 ms	864 KB	Output is partially correct
37	Partially correct	329 ms	824 KB	Output is partially correct
38	Partially correct	304 ms	572 KB	Output is partially correct
39	Partially correct	308 ms	828 KB	Output is partially correct
40	Partially correct	313 ms	572 KB	Output is partially correct
41	Partially correct	317 ms	1000 KB	Output is partially correct
42	Partially correct	306 ms	820 KB	Output is partially correct
43	Partially correct	301 ms	572 KB	Output is partially correct
44	Partially correct	344 ms	824 KB	Output is partially correct
45	Partially correct	320 ms	816 KB	Output is partially correct
46	Partially correct	302 ms	824 KB	Output is partially correct
47	Partially correct	310 ms	816 KB	Output is partially correct
48	Partially correct	303 ms	812 KB	Output is partially correct
49	Partially correct	346 ms	1272 KB	Output is partially correct
50	Partially correct	319 ms	1044 KB	Output is partially correct
51	Partially correct	353 ms	1052 KB	Output is partially correct
52	Partially correct	302 ms	824 KB	Output is partially correct
53	Partially correct	310 ms	572 KB	Output is partially correct
54	Partially correct	302 ms	824 KB	Output is partially correct
55	Partially correct	311 ms	824 KB	Output is partially correct
56	Partially correct	312 ms	1076 KB	Output is partially correct
57	Partially correct	313 ms	820 KB	Output is partially correct
58	Partially correct	303 ms	568 KB	Output is partially correct
59	Partially correct	329 ms	572 KB	Output is partially correct
60	Partially correct	301 ms	820 KB	Output is partially correct
61	Partially correct	317 ms	948 KB	Output is partially correct
62	Partially correct	309 ms	572 KB	Output is partially correct
63	Partially correct	304 ms	1080 KB	Output is partially correct