# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209538 | oolimry | Shuffle (NOI19_shuffle) | C++14 | 124 ms | 24056 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 "shuffle.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> solve(int N, int B, int K, int Q, int ST) {
if(K == 2){
vector<int> v;
int arr[N];
int adj[N][N];
//int vis[N];
int point1[N];
int point2[N];
for(int i = 0;i < N;i++){
for(int j = 0;j < N;j++){
adj[i][j] = 0;
}
arr[i] = 0;
}
vector<vector<int> > p;
vector<int> pl;
for(int i = 0;i < N;i++){
pl.push_back(i+1);
if(i % 2 == 1){
p.push_back(pl);
//cout << pl.size();
pl.clear();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |