| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 61195 | youngyojun | Broken Device (JOI17_broken_device) | C++11 | 88 ms | 3968 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 "Annalib.h"
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define revv(V) reverse(allv(V))
#define sz(V) ((int)(V).size())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
static int A[160], B[66];
void Anna(int N, ll X, int K, int P[]) {
fill(A, A+N+1, 1);
for(int i = 0; i < K; i++) A[P[i]] = 0;
for(int i = 0; i < 60; i++) B[i] = !!(X & (1ll<<i));
for(int i = 0, j = 0; i < N && j < 60; i += 3) {
if(A[i] + A[i+1] + A[i+2] < 2) {
A[i] = A[i+1] = A[i+2] = 0;
continue;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||