oj.uz

Submission #990408

# Submission time Handle Problem Language Result Execution time Memory
990408 2024-05-30T11:09:19 Z amine_aroua Broken Device (JOI17_broken_device) C++17
100 / 100
 29 ms 2608 KB 
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;
#define fore(i , n ) for(int i = 0 ; i < n; i++)
void Anna( int N, long long X, int K, int P[] )
{
    srand(6661);
    vector<int> final(N , 0);
    vector<bool> forbidden(N , 0);
    vector<int> seq(N);
    fore(i , N)
        seq[i] = i;
    random_shuffle(seq.begin() , seq.end());
    fore(i , K)
        forbidden[P[i]] = 1;
    for(int i = 0 ;i + 1< N;i+=2)
    {
        int cur = X%3;
        if(forbidden[seq[i]] == 1 && forbidden[seq[i + 1]] == 1)
            continue;
        if(forbidden[seq[i]] && (cur == 0 || cur == 2))
            continue;
        if(forbidden[seq[i + 1]] && (cur == 1 || cur == 2))
            continue;
        X/=3;
        if(cur == 0)
            final[seq[i]] = 1;
        else if(cur == 1)
            final[seq[i + 1]] = 1;
        else
            final[seq[i]] = final[seq[i + 1]] = 1;
    }
    fore(i , N)
        Set(i , final[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
#define fore(i , n ) for(int i = 0 ; i < n; i++)
using namespace std;
long long Bruno( int N, int A[] ){
    srand(6661);
    vector<int> seq(N);
    fore(i , N)
        seq[i] = i;
    random_shuffle(seq.begin() , seq.end());
    vector<int> po;
    for(int i = 0 ;i + 1 < N ; i+=2)
    {
        if(A[seq[i]] == 1 && A[seq[i + 1]] == 1)
            po.pb(2);
        else if(A[seq[i]] == 1)
            po.pb(0);
        else if(A[seq[i + 1]] == 1)
            po.pb(1);
    }
    reverse(po.begin() , po.end());
    Int X = 0;
    for(auto x : po)
        X = 3*X + x;
    return X;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2320 KB Output is correct - L* = 40
2 Correct 27 ms 2396 KB Output is correct - L* = 40
3 Correct 28 ms 2368 KB Output is correct - L* = 40
4 Correct 29 ms 2404 KB Output is correct - L* = 40
5 Correct 28 ms 2392 KB Output is correct - L* = 40
6 Correct 27 ms 2464 KB Output is correct - L* = 40
7 Correct 27 ms 2480 KB Output is correct - L* = 40
8 Correct 27 ms 2396 KB Output is correct - L* = 40
9 Correct 27 ms 2392 KB Output is correct - L* = 40
10 Correct 27 ms 2368 KB Output is correct - L* = 40
11 Correct 28 ms 2604 KB Output is correct - L* = 40
12 Correct 27 ms 2396 KB Output is correct - L* = 40
13 Correct 27 ms 2396 KB Output is correct - L* = 40
14 Correct 27 ms 2396 KB Output is correct - L* = 40
15 Correct 28 ms 2396 KB Output is correct - L* = 40
16 Correct 27 ms 2396 KB Output is correct - L* = 40
17 Correct 27 ms 2396 KB Output is correct - L* = 40
18 Correct 27 ms 2472 KB Output is correct - L* = 40
19 Correct 28 ms 2396 KB Output is correct - L* = 40
20 Correct 27 ms 2372 KB Output is correct - L* = 40
21 Correct 27 ms 2404 KB Output is correct - L* = 40
22 Correct 28 ms 2392 KB Output is correct - L* = 40
23 Correct 27 ms 2392 KB Output is correct - L* = 40
24 Correct 27 ms 2404 KB Output is correct - L* = 40
25 Correct 28 ms 2556 KB Output is correct - L* = 40
26 Correct 27 ms 2424 KB Output is correct - L* = 40
27 Correct 27 ms 2308 KB Output is correct - L* = 40
28 Correct 27 ms 2448 KB Output is correct - L* = 40
29 Correct 29 ms 2484 KB Output is correct - L* = 40
30 Correct 27 ms 2608 KB Output is correct - L* = 40
31 Correct 28 ms 2440 KB Output is correct - L* = 40
32 Correct 27 ms 2404 KB Output is correct - L* = 40
33 Correct 28 ms 2392 KB Output is correct - L* = 40
34 Correct 27 ms 2396 KB Output is correct - L* = 40
35 Correct 27 ms 2396 KB Output is correct - L* = 40
36 Correct 28 ms 2396 KB Output is correct - L* = 40
37 Correct 28 ms 2480 KB Output is correct - L* = 40
38 Correct 27 ms 2396 KB Output is correct - L* = 40
39 Correct 29 ms 2396 KB Output is correct - L* = 40
40 Correct 27 ms 2392 KB Output is correct - L* = 40