oj.uz

답안 #990397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990397 2024-05-30T11:04:37 Z amine_aroua Broken Device (JOI17_broken_device) C++17
0 / 100
 34 ms 2868 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))
        X/=2;
        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
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 27 ms 2780 KB Output isn't correct - L* = 0
2 Partially correct 27 ms 2808 KB Output isn't correct - L* = 0
3 Partially correct 27 ms 2780 KB Output isn't correct - L* = 0
4 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
5 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
6 Partially correct 27 ms 2752 KB Output isn't correct - L* = 0
7 Partially correct 27 ms 2784 KB Output isn't correct - L* = 0
8 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
9 Partially correct 27 ms 2856 KB Output isn't correct - L* = 0
10 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
11 Partially correct 30 ms 2684 KB Output isn't correct - L* = 0
12 Partially correct 27 ms 2756 KB Output isn't correct - L* = 0
13 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
14 Partially correct 28 ms 2768 KB Output isn't correct - L* = 0
15 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
16 Partially correct 28 ms 2776 KB Output isn't correct - L* = 0
17 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
18 Partially correct 27 ms 2716 KB Output isn't correct - L* = 0
19 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
20 Partially correct 27 ms 2784 KB Output isn't correct - L* = 0
21 Partially correct 27 ms 2768 KB Output isn't correct - L* = 0
22 Partially correct 27 ms 2780 KB Output isn't correct - L* = 0
23 Partially correct 27 ms 2748 KB Output isn't correct - L* = 0
24 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
25 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
26 Partially correct 27 ms 2784 KB Output isn't correct - L* = 0
27 Partially correct 34 ms 2868 KB Output isn't correct - L* = 0
28 Partially correct 29 ms 2772 KB Output isn't correct - L* = 0
29 Partially correct 27 ms 2784 KB Output isn't correct - L* = 0
30 Partially correct 27 ms 2852 KB Output isn't correct - L* = 0
31 Partially correct 28 ms 2844 KB Output isn't correct - L* = 0
32 Partially correct 28 ms 2812 KB Output isn't correct - L* = 0
33 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
34 Partially correct 27 ms 2768 KB Output isn't correct - L* = 0
35 Partially correct 27 ms 2792 KB Output isn't correct - L* = 0
36 Partially correct 27 ms 2804 KB Output isn't correct - L* = 0
37 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
38 Partially correct 27 ms 2772 KB Output isn't correct - L* = 0
39 Partially correct 29 ms 2852 KB Output isn't correct - L* = 0
40 Partially correct 27 ms 2804 KB Output isn't correct - L* = 0