oj.uz

Submission #260402

# Submission time Handle Problem Language Result Execution time Memory
260402 2020-08-10T08:24:27 Z 최은수(#5043) Broken Device (JOI17_broken_device) C++14
8 / 100
 52 ms 3200 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;
inline void set(int i,int x,int y,int z)
{
    Set(i,x);
    Set(i+1,y);
    Set(i+2,z);
    return;
}
static bool chk[150];
void Anna(int N,ll X,int K,int P[])
{
    for(int i=0;i<N;i++)
        chk[i]=0;
    for(int i=0;i<K;i++)
        chk[P[i]]=1;
    vector<int>dat;
    for(int i=0;i<60;i++)
        dat.eb(X>>i&1);
    for(int i=0;i<90;i++)
        dat.eb(0);
    for(int i=0,c=0;i<150;i+=3)
    {
        int cbit=dat[c++];
        int col=(chk[i]?4:0)+(chk[i+1]?2:0)+(chk[i+2]?1:0);
        if(col>=3&&col!=4)
            set(i,0,0,0);
        else if(col==0)
        {
            int cbit2=dat[c++];
            if(cbit==1)
            {
                if(cbit2==1)
                    set(i,1,0,1);
                else
                    set(i,1,0,0);
            }
            else if(cbit2==1)
                set(i,1,1,0);
            else
                set(i,1,1,1);
        }
        else if(col==1)
        {
            int cbit2=dat[c];
            if(cbit==cbit2)
                set(i,0,1,0);
            else if(cbit==1)
                set(i,1,0,0),c++;
            else
                set(i,1,1,0),c++;
        }
        else if(col==2)
        {
            int cbit2=dat[c];
            if(cbit==0)
                set(i,0,0,1);
            else if(cbit2==1)
                set(i,1,0,1),c++;
            else
                set(i,1,0,0),c++;
        }
        else if(cbit==1)
            set(i,0,1,1);
        else
            set(i,0,0,1);
    }
    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[])
{
    vector<int>dat(150,0);
    for(int i=0,c=0;i<150;i+=3)
    {
        int col=A[i]*4+A[i+1]*2+A[i+2];
        if(col==1)
            dat[c++]=0;
        else if(col==2)
            dat[c++]=-1;
        else if(col==3)
            dat[c++]=1;
        else if(col==4)
            dat[c++]=1,dat[c++]=0;
        else if(col==5)
            dat[c++]=1,dat[c++]=1;
        else if(col==6)
            dat[c++]=0,dat[c++]=1;
        else if(col==7)
            dat[c++]=0,dat[c++]=0;
    }
    for(int i=149;i-->0;)
        if(dat[i]==-1)
            dat[i]=dat[i+1];
    ll x=0;
    for(int i=0;i<60;i++)
        x|=(ll)dat[i]<<i;
    return x;
}

Subtask #1
8.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
2 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
3 Partially correct 47 ms 3056 KB Output is partially correct - L* = 14
4 Partially correct 46 ms 3056 KB Output is partially correct - L* = 14
5 Partially correct 44 ms 3072 KB Output is partially correct - L* = 14
6 Partially correct 48 ms 3056 KB Output is partially correct - L* = 14
7 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
8 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
9 Partially correct 45 ms 3072 KB Output is partially correct - L* = 14
10 Partially correct 44 ms 3072 KB Output is partially correct - L* = 14
11 Partially correct 41 ms 3056 KB Output is partially correct - L* = 14
12 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
13 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
14 Partially correct 45 ms 3072 KB Output is partially correct - L* = 14
15 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
16 Partially correct 43 ms 3056 KB Output is partially correct - L* = 14
17 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
18 Partially correct 43 ms 3064 KB Output is partially correct - L* = 14
19 Partially correct 43 ms 3056 KB Output is partially correct - L* = 14
20 Partially correct 41 ms 3056 KB Output is partially correct - L* = 14
21 Partially correct 41 ms 3072 KB Output is partially correct - L* = 14
22 Partially correct 45 ms 3072 KB Output is partially correct - L* = 14
23 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
24 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
25 Partially correct 44 ms 3072 KB Output is partially correct - L* = 14
26 Partially correct 43 ms 3056 KB Output is partially correct - L* = 14
27 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
28 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
29 Partially correct 43 ms 3064 KB Output is partially correct - L* = 14
30 Partially correct 41 ms 3072 KB Output is partially correct - L* = 14
31 Partially correct 43 ms 3072 KB Output is partially correct - L* = 14
32 Partially correct 44 ms 3120 KB Output is partially correct - L* = 14
33 Partially correct 43 ms 3056 KB Output is partially correct - L* = 14
34 Partially correct 44 ms 3056 KB Output is partially correct - L* = 14
35 Partially correct 45 ms 3072 KB Output is partially correct - L* = 14
36 Partially correct 50 ms 3200 KB Output is partially correct - L* = 14
37 Partially correct 43 ms 3056 KB Output is partially correct - L* = 14
38 Partially correct 44 ms 3072 KB Output is partially correct - L* = 14
39 Partially correct 52 ms 3056 KB Output is partially correct - L* = 14
40 Partially correct 48 ms 3072 KB Output is partially correct - L* = 14