제출 #1174263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174263		madamadam3	XOR (IZhO12_xor)	C++20	0 / 100	2093 ms	1092 KiB

xor

#include <bits/stdc++.h>

using namespace std;

/*
    SAPO 2025 TC4 Day 2 - Largest Subarray
    copied from IZhO 2012 - XOR

    SAPO breakdown was:
    n <= 10^5, c[i] < 2^30
    - subtask 1 (40 pts): n <= 5000
    - subtask 2 (60 pts): no further constraints

    40/100 pt solution here
*/

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, x; cin >> n >> x;
    vector<int> c(n); for (int i = 0; i < n; i++) cin >> c[i];
    vector<int> prefix(n + 1, 0); for (int i = 1; i <= n; i++) prefix[i] = prefix[i - 1] ^ c[i - 1];

    int best_idx = 0;
    int best_k = 0;

    for (int i = 0; i < n; i++) {
        for (int k = best_k + 1; i + k - 1 < n; k++) {
            int r = i + k - 1;
            if ((prefix[r + 1] ^ prefix[i]) >= x) {
                best_idx = i;
                best_k = k;
            }
        }
    }

    cout << best_idx + 1 << " " << best_k;
    return 0;
}

• Subtask 1: 0 / 100