# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23144 | duongthoi1999 | Broken Device (JOI17_broken_device) | C++14 | 49 ms | 4644 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>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef pair<int,int> ii;
const int mod = (int) 1e9 + 7;
int f[150];
vector<int> mp2[4];
vector<int> mp1[3];
vector<int> b;
void Anna( int N, long long X, int K, int P[] ){
mp2[0] = {0, 1, 0}; /// 00
mp2[1] = {1, 0, 1}; /// 10
mp2[2] = {1, 1, 0}; /// 01
mp2[3] = {1, 1, 1}; /// 11
mp1[0] = {0, 0, 1}; /// 0
mp1[1] = {0, 1, 1}; /// 1
mp1[2] = {1, 0, 0}; /// 1
rep(i, 0, N) f[i] = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |