| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1328453 | QuocSensei | ICC (CEOI16_icc) | C++20 | 196 ms | 612 KiB |
#include "icc.h"
#include <bits/stdc++.h>
#define ll long long
#define el cout << endl
#define ii pair<int, int>
#define fi first
#define se second
using namespace std;
const int maxn = 1e2;
namespace SUBTASK_1
{
int n;
bool check[maxn + 10][maxn + 10];
void run(int N)
{
n = N;
for (int _ = 1; _ <= n - 1; _++)
{
for (int i = 1; i <= n; i++)
{
bool flag = 0;
for (int j = i + 1; j <= n; j++)
{
if (check[i][j])
continue;
int a[1], b[1];
a[0] = i;
b[0] = j;
if (query(1, 1, a, b))
{
setRoad(i, j);
check[i][j] = 1;
flag = 1;
break;
}
}
if (flag)
break;
}
}
}
};
void run(int N)
{
SUBTASK_1::run(N);
}| # | 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... | ||||
