oj.uz

답안 #991400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991400 2024-06-02T08:40:42 Z onbert Broken Device (JOI17_broken_device) C++17
85 / 100
 40 ms 2732 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 37, M = 251;
 
void Anna(int32_t n, long long X, int32_t k, int32_t p[]){
    int pwr[m+1];
    pwr[0] = 1;
    for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;

    int a[n];
    for (int i=0;i<n;i++) a[i] = 1;
    for (int i=0;i<k;i++) a[p[i]] = 0;
    k = 0;
    for (int i=0;i<n;i++) if (!a[i] || !a[i^1]) {
        a[i] = 0;
        if (i%2==0) k++;
    }
    // cout << k << endl;
    if (k>=38) {
        int Y = X/pwr[33];
        // cout << "test " << Y << endl;
        int pro = 1;
        for (int i=0;i<75;i++) if (!a[i*2]) pro = pro * (i+1) % M;
        bool done = false;
        for (int i=0;i<75;i++) {
            for (int j=i+1;j<75;j++) {
                if ((i+1)*(j+1)*pro % M == Y && a[i*2] && a[j*2]) {
                    a[i*2] = a[i*2+1] = a[j*2] = a[j*2+1] = 0;
                    done = true;
                    break;
                }
            }
            if (done) break;
        }
    }
    int cur = 0;
    for (int i=0;i<n;i+=2) {
        int val = X % 3;
        int x = 1, y = 1;
        if (val==0) x = 0, y = 1;
        if (val==1) x = 1, y = 0;
        if (((!a[i]) && x) || ((!a[i+1]) && y)) {
            a[i] = a[i+1] = 0;
            continue;
        }
        a[i] = x, a[i+1] = y;
        X /= 3;
        cur++;
    }
    // for (int i=0;i<n;i++) cout << a[i]; cout << endl;
    for (int i=0;i<n;i++) Set(i, (int32_t)a[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 251;
 
long long Bruno(int32_t n, int32_t a[]){
    int m = 37;
    int pwr[m+1];
    pwr[0] = 1;
    for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;
    int k = 0;
    for (int i=0;i<n;i+=2) k += (!a[i] && !a[i+1]);
    int x = 0;
    if (k>=38) {
        int prod = 1;
        for (int i =0;i<75;i++) if (!a[i*2] && !a[i*2+1]) prod = prod * (i+1) % M;
        x += prod * pwr[33];
        // cout << prod << endl;
        m = 32;
    }
    int cur = 0;
    for (int i=0;i<n && cur<=m;i+=2) if (a[i]==1 || a[i+1]==1) {
        if (a[i]==1 && a[i+1]==0) x += pwr[cur];
        if (a[i]==1 && a[i+1]==1) x += 2 * pwr[cur];
        cur++;
    }
    return x;
}

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 30 ms 2372 KB Output is partially correct - L* = 37
2 Partially correct 36 ms 2372 KB Output is partially correct - L* = 37
3 Partially correct 24 ms 2488 KB Output is partially correct - L* = 37
4 Partially correct 27 ms 2624 KB Output is partially correct - L* = 37
5 Partially correct 25 ms 2396 KB Output is partially correct - L* = 37
6 Partially correct 23 ms 2396 KB Output is partially correct - L* = 37
7 Partially correct 30 ms 2388 KB Output is partially correct - L* = 37
8 Partially correct 23 ms 2464 KB Output is partially correct - L* = 37
9 Partially correct 26 ms 2388 KB Output is partially correct - L* = 37
10 Partially correct 20 ms 2612 KB Output is partially correct - L* = 37
11 Partially correct 24 ms 2488 KB Output is partially correct - L* = 37
12 Partially correct 27 ms 2560 KB Output is partially correct - L* = 37
13 Partially correct 25 ms 2480 KB Output is partially correct - L* = 37
14 Partially correct 30 ms 2436 KB Output is partially correct - L* = 37
15 Partially correct 24 ms 2592 KB Output is partially correct - L* = 37
16 Partially correct 24 ms 2652 KB Output is partially correct - L* = 37
17 Partially correct 23 ms 2588 KB Output is partially correct - L* = 37
18 Partially correct 24 ms 2392 KB Output is partially correct - L* = 37
19 Partially correct 26 ms 2624 KB Output is partially correct - L* = 37
20 Partially correct 23 ms 2572 KB Output is partially correct - L* = 37
21 Partially correct 26 ms 2680 KB Output is partially correct - L* = 37
22 Partially correct 24 ms 2404 KB Output is partially correct - L* = 37
23 Partially correct 23 ms 2404 KB Output is partially correct - L* = 37
24 Partially correct 24 ms 2732 KB Output is partially correct - L* = 37
25 Partially correct 26 ms 2372 KB Output is partially correct - L* = 37
26 Partially correct 22 ms 2404 KB Output is partially correct - L* = 37
27 Partially correct 26 ms 2488 KB Output is partially correct - L* = 37
28 Partially correct 22 ms 2388 KB Output is partially correct - L* = 37
29 Partially correct 25 ms 2372 KB Output is partially correct - L* = 37
30 Partially correct 25 ms 2488 KB Output is partially correct - L* = 37
31 Partially correct 40 ms 2396 KB Output is partially correct - L* = 37
32 Partially correct 27 ms 2396 KB Output is partially correct - L* = 37
33 Partially correct 22 ms 2560 KB Output is partially correct - L* = 37
34 Partially correct 22 ms 2396 KB Output is partially correct - L* = 37
35 Partially correct 23 ms 2392 KB Output is partially correct - L* = 37
36 Partially correct 23 ms 2608 KB Output is partially correct - L* = 37
37 Partially correct 24 ms 2392 KB Output is partially correct - L* = 37
38 Partially correct 27 ms 2368 KB Output is partially correct - L* = 37
39 Partially correct 20 ms 2492 KB Output is partially correct - L* = 37
40 Partially correct 31 ms 2396 KB Output is partially correct - L* = 37