oj.uz

답안 #1011667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011667 2024-07-01T03:55:36 Z 12345678 Broken Device (JOI17_broken_device) C++17
85 / 100
 40 ms 2760 KB 
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=150;
mt19937 rng(12345678);
int f, c[nx];
vector<pair<int, int>> v;

void init()
{
    v.clear();
    for (int i=0; i<nx; i++) v.push_back({rng(), i});
    sort(v.begin(), v.end());
    for (int i=0; i<nx; i++) c[i]=v[i].second;
}

void Anna( int N, long long X, int K, int P[] ){
    init();
    vector<int> b(nx);
    //for (int i=0; i<N;i ++) cout<<"perm "<<i<<' '<<c[i]<<'\n';
    for (int i=0; i<K; i++) b[P[i]]=1;
    for (int i=0; i<75; i++)
    {
        if (b[c[2*i]]||b[c[2*i+1]]||X==0) Set(c[2*i], 0), Set(c[2*i+1], 0);
        else Set(c[2*i], ((X%3)+1)/2), Set(c[2*i+1], ((X%3)+1)%2), X/=3;
    }
}

#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int kx=60, nxx=150;

mt19937 rng2(12345678);
int f2, c2[nxx];
vector<pair<int, int>> v2;

void init2()
{
    v2.clear();
    for (int i=0; i<nxx; i++) v2.push_back({rng2(), i});
    sort(v2.begin(), v2.end());
    for (int i=0; i<nxx; i++) c2[i]=v2[i].second;
}

long long Bruno( int N, int A[] ){
    init2(); 
    vector<ll> p(kx);
    ll res=0, cnt=0;
    p[0]=1;
    for (int i=1; i<kx; i++) p[i]=p[i-1]*3;
    for (int i=0; i<75; i++) if (A[c2[2*i]]||A[c2[2*i+1]]) res+=p[cnt]*(A[c2[2*i]]*2+A[c2[2*i+1]]-1),cnt++; 
    return res;
}

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 33 ms 2396 KB Output is partially correct - L* = 38
2 Partially correct 33 ms 2636 KB Output is partially correct - L* = 39
3 Partially correct 33 ms 2448 KB Output is partially correct - L* = 39
4 Partially correct 40 ms 2504 KB Output is partially correct - L* = 38
5 Partially correct 33 ms 2372 KB Output is partially correct - L* = 38
6 Partially correct 38 ms 2304 KB Output is partially correct - L* = 37
7 Partially correct 34 ms 2396 KB Output is partially correct - L* = 39
8 Partially correct 33 ms 2500 KB Output is partially correct - L* = 38
9 Partially correct 33 ms 2564 KB Output is partially correct - L* = 39
10 Partially correct 36 ms 2368 KB Output is partially correct - L* = 38
11 Partially correct 33 ms 2708 KB Output is partially correct - L* = 38
12 Partially correct 37 ms 2760 KB Output is partially correct - L* = 39
13 Partially correct 33 ms 2652 KB Output is partially correct - L* = 38
14 Partially correct 33 ms 2472 KB Output is partially correct - L* = 38
15 Partially correct 34 ms 2392 KB Output is partially correct - L* = 38
16 Partially correct 35 ms 2560 KB Output is partially correct - L* = 38
17 Partially correct 33 ms 2648 KB Output is partially correct - L* = 38
18 Partially correct 33 ms 2656 KB Output is partially correct - L* = 39
19 Partially correct 33 ms 2656 KB Output is partially correct - L* = 38
20 Partially correct 36 ms 2396 KB Output is partially correct - L* = 38
21 Partially correct 29 ms 2372 KB Output is partially correct - L* = 38
22 Partially correct 32 ms 2372 KB Output is partially correct - L* = 38
23 Partially correct 31 ms 2496 KB Output is partially correct - L* = 38
24 Partially correct 31 ms 2396 KB Output is partially correct - L* = 39
25 Partially correct 29 ms 2636 KB Output is partially correct - L* = 39
26 Partially correct 33 ms 2396 KB Output is partially correct - L* = 38
27 Partially correct 31 ms 2396 KB Output is partially correct - L* = 38
28 Partially correct 28 ms 2492 KB Output is partially correct - L* = 38
29 Partially correct 32 ms 2396 KB Output is partially correct - L* = 39
30 Partially correct 33 ms 2404 KB Output is partially correct - L* = 38
31 Partially correct 34 ms 2396 KB Output is partially correct - L* = 38
32 Partially correct 33 ms 2628 KB Output is partially correct - L* = 39
33 Partially correct 33 ms 2312 KB Output is partially correct - L* = 38
34 Partially correct 33 ms 2372 KB Output is partially correct - L* = 38
35 Partially correct 35 ms 2400 KB Output is partially correct - L* = 38
36 Partially correct 33 ms 2644 KB Output is partially correct - L* = 38
37 Partially correct 33 ms 2396 KB Output is partially correct - L* = 38
38 Partially correct 34 ms 2396 KB Output is partially correct - L* = 38
39 Partially correct 33 ms 2512 KB Output is partially correct - L* = 39
40 Partially correct 37 ms 2392 KB Output is partially correct - L* = 38