oj.uz

Submission #260355

# Submission time Handle Problem Language Result Execution time Memory
260355 2020-08-10T06:41:04 Z 최은수(#5043) Broken Device (JOI17_broken_device) C++14
0 / 100
 62 ms 3584 KB 
#include"Annalib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
static bool chk[150];
void Anna(int N,ll X,int K,int P[])
{
    for(int i=0;i<K;i++)
        chk[P[i]]=1;
    for(int i=0,c=0;i<75;i++)
    {
        Set(i*2,!chk[i*2]&&!chk[i*2+1]?1:0);
        Set(i*2+1,X>>c&1);
        if(!chk[i*2]&&!chk[i*2+1])
            c++;
    }
    return;
}
#include"Brunolib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;

ll Bruno(int N,int A[])
{
    ll x=0;
    for(int i=0,c=0;i<75;i++)
    {
        if(A[i*2]==0)
            continue;
        x|=(ll)A[i*2+1]<<c;
        c++;
    }
    return x;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
2 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
3 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
4 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
5 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
6 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
7 Partially correct 47 ms 3328 KB Output isn't correct - L* = 0
8 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
9 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
10 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
11 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
12 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
13 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
14 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
15 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
16 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
17 Partially correct 43 ms 3320 KB Output isn't correct - L* = 0
18 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
19 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
20 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
21 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
22 Partially correct 62 ms 3312 KB Output isn't correct - L* = 0
23 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
24 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
25 Partially correct 43 ms 3584 KB Output isn't correct - L* = 0
26 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
27 Partially correct 43 ms 3392 KB Output isn't correct - L* = 0
28 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
29 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
30 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
31 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
32 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
33 Partially correct 41 ms 3568 KB Output isn't correct - L* = 0
34 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 41 ms 3320 KB Output isn't correct - L* = 0
36 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
38 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
39 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
40 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0