| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 249817 | Blagojce | Broken Device (JOI17_broken_device) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;
#include "Annalib.h"
void Anna(int N, long long X, int K, int P[]){
bool ok[150];
memset(ok, false, sizeof(ok));
fr(i, 0, K) ok[P[i]] = true;
fr(i, 0, 75){
if(!ok[i] && !ok[i+75]){
set(i, 1);
}
else{
set(i, 0);
}
}
int tmp = 0;
fr(i, 0, 75){
if(tmp>60){
set(i, 0);
continue;
}
if(!ok[i]&&!ok[i+75]){
if(X&(1LL<<tmp)){
set(i+75, 1);
}
else{
set(i+75, 0);
}
tmp ++;
}
else{
set(i, 0);
}
}
}
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;
#include "Brunolib.h"
long long Bruno( int N, int A[]){
vector<int> pos;
fr(i, 0, 75) if(A[i] == 1) pos.pb(i+75);
ll ret = 0;
fr(i, 0, pos.size()){
if(A[pos[i]] == 1) ret |= (1LL<<i);
}
return ret;
}