Submission #44444

#	Time	Username	Problem	Language	Result	Execution time	Memory
44444		khohko	Broken Device (JOI17_broken_device)	C++17	0 / 100	5 ms	2872 KiB

Anna

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

#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define lol long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((lol)(1e9+100))
#define MX ((lol)(4e9+100))
#define ARRS ((lol)(1e6+100))
#define MOD ((lol)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#define pb push_back
#define PI ((double)3.141592653)
#define LG 21




void Anna( int N, long long X, int K, int P[] ){
    int f[300];
    for(int i=0; i<N; i++)f[i]=0;
    for(int i=0; i<K; i++)
        f[P[i]]=1;
    f[N]=1;
    for(int i=0; i<N; i++){
      //  cout<<X<<endl;
        if(X){
            if(X&1){
                if(!f[i]&&!f[i+1]){
                    Set(i,1);
                    Set(i+1,1);
                    X>>=1ll;
                    i++;
                    continue;
                }
            }
            else {
                if(!f[i]){
                    Set(i,1);
                    X>>=1;
                    i++;
                    Set(i,0);
                    continue;
                }
            }
            if(f[i])Set(i,0);
        }
        else Set(i,0);
    }
   // cout<<X<<endl;
}

Bruno

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

#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define lol long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((lol)(1e9+100))
#define MX ((lol)(4e9+100))
#define ARRS ((lol)(1e6+100))
#define MOD ((lol)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#define pb push_back
#define PI ((double)3.141592653)
#define LG 21



long long Bruno( int N, int A[] ){
    ll p=0;
    ll k=1;
    for(int i=0; i<N; i++){
        if(A[i]&&A[i+1])p+=k,k*=2ll,i++;
        else if(A[i])k*=2ll;
    }
  //  cout<<p<<endl;
    return p;
}


//
//int main(){
//    #ifdef KHOKHO
//        freopen("in.in","r",stdin);
//        freopen("out.out","w",stdout);
//    #endif // KHOKHO
//    cin>>n;
//
//}

• Subtask 1: 0 / 100