oj.uz

답안 #1078497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078497 2024-08-27T18:48:34 Z someone Broken Device (JOI17_broken_device) C++14
0 / 100
 2000 ms 604 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using i64 = long long;
using namespace std;

const i64 MOD1 = 1e9 + 7, MOD2 = 1e9 + 9;

bool backtrack(int i, i64 rem, vector<array<int, 2>>& crt, vector<i64>& sumAft, vector<int>& used) {
    if(i == sz(crt)) return false;
    if(rem > sumAft[i]) return false;
    if(rem == crt[i][0]) {
        used.push_back(crt[i][1]);
        return true;
    }
    if(rem > crt[i][0]) {
        if(backtrack(i+1, rem - crt[i][0], crt, sumAft, used)) {
            used.push_back(crt[i][1]);
            return true;
        }
    }
    return backtrack(i+1, rem, crt, sumAft, used);
}

void Anna(int N, long long X, int K, int P[]) {
    vector<bool> broken(N);
    for(int i = 0; i < K; i++)
        broken[P[i]] = 1;
    
    mt19937 rng(42);
    X ^= rng();
    vector<array<int, 2>> crt[2];
    vector<i64> sumAft[2];
    for(int i = 0; i < N/2; i++) {
        int val = rng() % MOD1;
        if(!broken[i]) crt[0].push_back({val, i});
    }
    for(int i = N/2; i < N; i++) {
        int val = rng() % MOD2;
        if(!broken[i]) crt[1].push_back({val, i});
    }

    sort(all(crt[0])); reverse(all(crt[0]));
    sort(all(crt[1])); reverse(all(crt[1]));
    for(int i = 0; i < 2; i++) {
        sumAft[i].resize(sz(crt[i]));
        for(int j = sz(crt[i])-2; j >= 0; j--)
            sumAft[i][j] = sumAft[i][j+1] + crt[i][j+1][0];
        for(int j = 0; j < sz(crt[i]); j++)
            sumAft[i][j] += crt[i][j][0];
    }
    vector<int> used[2];
    for(int i = 0; i < 76; i++) {
        if(backtrack(0, X % MOD1 + i * MOD1, crt[0], sumAft[0], used[0])) {
            i = 76;
        }
    }
    for(int i = 0; i < 76; i++) {
        if(backtrack(0, X % MOD2 + i * MOD2, crt[1], sumAft[1], used[1])) {
            i = 76;
        }
    }
    vector<int> ans(N);
    for(int i : used[0]) ans[i] = 1;
    for(int i : used[1]) ans[i] = 1;
    for(int i = 0; i < N; i++)
        Set(i, ans[i]);
}

#include "Brunolib.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using i64 = long long;
using namespace std;

const i64 MOD1 = 1e9 + 7, MOD2 = 1e9 + 9;

using ll = __int128;

ll euclid(ll a, ll b, ll &x, ll &y) {
	if (!b) return x = 1, y = 0, a;
	ll d = euclid(b, a % b, y, x);
	return y -= a/b * x, d;
}

ll crt(ll a, ll m, ll b, ll n) {
	if (n > m) swap(a, b), swap(m, n);
	ll x, y, g = euclid(m, n, x, y);
	assert((a - b) % g == 0); // else no solution
	x = (b - a) % n * x % n / g * m + a;
	return x < 0 ? x + m*n/g : x;
}

long long Bruno( int N, int A[] ){
    mt19937 rng(42);
    i64 xored = rng(), a = 0, b = 0;
    for(int i = 0; i < N/2; i++) {
        i64 val = rng();
        if(A[i]) a ^= val;
    }
    for(int i = N/2; i < N; i++) {
        i64 val = rng();
        if(A[i]) b ^= val;
    }

    return ((i64)crt(a, MOD1, b, MOD2)) ^ xored;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2076 ms 444 KB Time limit exceeded
2 Execution timed out 2057 ms 448 KB Time limit exceeded
3 Execution timed out 2063 ms 444 KB Time limit exceeded
4 Execution timed out 2094 ms 456 KB Time limit exceeded
5 Execution timed out 2068 ms 436 KB Time limit exceeded
6 Execution timed out 2057 ms 440 KB Time limit exceeded
7 Execution timed out 2063 ms 440 KB Time limit exceeded
8 Execution timed out 2025 ms 444 KB Time limit exceeded
9 Execution timed out 2021 ms 444 KB Time limit exceeded
10 Execution timed out 2068 ms 348 KB Time limit exceeded
11 Execution timed out 2044 ms 344 KB Time limit exceeded
12 Execution timed out 2058 ms 604 KB Time limit exceeded
13 Execution timed out 2007 ms 348 KB Time limit exceeded
14 Execution timed out 2025 ms 440 KB Time limit exceeded
15 Execution timed out 2072 ms 440 KB Time limit exceeded
16 Execution timed out 2009 ms 348 KB Time limit exceeded
17 Execution timed out 2044 ms 504 KB Time limit exceeded
18 Execution timed out 2020 ms 344 KB Time limit exceeded
19 Execution timed out 2071 ms 444 KB Time limit exceeded
20 Execution timed out 2029 ms 344 KB Time limit exceeded
21 Execution timed out 2058 ms 444 KB Time limit exceeded
22 Execution timed out 2032 ms 444 KB Time limit exceeded
23 Execution timed out 2041 ms 460 KB Time limit exceeded
24 Execution timed out 2031 ms 344 KB Time limit exceeded
25 Execution timed out 2060 ms 444 KB Time limit exceeded
26 Execution timed out 2071 ms 456 KB Time limit exceeded
27 Execution timed out 2041 ms 348 KB Time limit exceeded
28 Execution timed out 2066 ms 348 KB Time limit exceeded
29 Execution timed out 2073 ms 444 KB Time limit exceeded
30 Execution timed out 2044 ms 348 KB Time limit exceeded
31 Execution timed out 2061 ms 348 KB Time limit exceeded
32 Execution timed out 2062 ms 460 KB Time limit exceeded
33 Execution timed out 2036 ms 344 KB Time limit exceeded
34 Execution timed out 2074 ms 348 KB Time limit exceeded
35 Execution timed out 2048 ms 440 KB Time limit exceeded
36 Execution timed out 2071 ms 348 KB Time limit exceeded
37 Execution timed out 2063 ms 348 KB Time limit exceeded
38 Execution timed out 2009 ms 344 KB Time limit exceeded
39 Execution timed out 2056 ms 348 KB Time limit exceeded
40 Execution timed out 2076 ms 348 KB Time limit exceeded