Submission #1065352

#TimeUsernameProblemLanguageResultExecution timeMemory
1065352Jarif_RahmanAmusement Park (JOI17_amusement_park)C++17
10 / 100
12 ms2344 KiB
#include "Joi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

void Joi(int n, int m, int A[], int B[], ll X, int T){
    vector<int> bin;
    for(int i = 0; i < 60; i++){
        bin.push_back(X%2);
        X/=2;
    }
    for(int i = 0; i < n; i++) MessageBoard(i, bin[i%60]);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

ll Ioi(int n, int m, int A[], int B[], int p, int v, int T){
    vector<int> bin(60, -1);
    bin[p%60] = v;
    int left = 59;
    while(p && left){
        p--;
        bin[p%60] = Move(p);
        left--;
    }
    while(left){
        p++;
        if(bin[p%60] == -1){
            bin[p%60] = Move(p);
            left--;
        }
        else Move(p);
    }

    ll X = 0;
    for(int i = 0; i < 60; i++) if(bin[i]) X+=1LL<<i;
    return X;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...