# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15520 | xhae | 쿼터너리 컴퓨터 (kriii3_Z) | C++14 | 4000 ms | 1720 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> f(N);
for (int i=0; i<N; i++) cin >> f[i];
vector<int> cmd(M), x(M), y(M), z(M);
for (int i=0; i<M; i++)
cin >> cmd[i] >> x[i] >> y[i] >> z[i];
vector<int> t(N);
for (int bit=0; bit<(1<<(2*N)); bit ++) {
int ok = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |