| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361851 | stuckinpandemic | ICC (CEOI16_icc) | C++20 | 128 ms | 884 KiB |
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define endl "\n"
#define pii pair<int, int>
#define piv pair<int, vector<pii>>
void run(int n){
vector<vector<int>> adj(n + 1, vector<int>(n + 1, 0));
for(int i = 1; i < n; i++){
bool flag = false;
for(int j = 1; j < n && !flag; j++){
for(int k = j + 1; k <= n && !flag; k++){
if(!adj[j][k]){
int q = query(1, 1, new int[]{j}, new int[]{k});
if(q == 1){
adj[j][k] = 1;
setRoad(j, k);
flag = true;
}
}
}
}
}
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
