Submission #1289790

#TimeUsernameProblemLanguageResultExecution timeMemory
1289790lucaskojimaICC (CEOI16_icc)C++17
7 / 100
193 ms620 KiB
#include "bits/stdc++.h"
#include "icc.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int N   = 1000;

int a[N + 1], b[N + 1];

void run(int n) {
  vector edge(n + 1, vector<bool>(n + 1));

  for (int _ = 0; _ < n - 1; _++) {
    for (int i = 1; i <= n; i++)
      for (int j = i + 1; j <= n; j++) {
        if (edge[i][j]) continue;

        a[0] = i;
        b[0] = j;
        if (query(1, 1, a, b) == 1) {
          setRoad(i, j);
          edge[i][j] = true;
          goto NEXT;
        }
      }

    NEXT:;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...