oj.uz

Submission #319513

# Submission time Handle Problem Language Result Execution time Memory
319513 2020-11-05T13:09:18 Z shaf_wa_nur ICC (CEOI16_icc) C++14
0 / 100
 503 ms 616 KB 
/**
 *    author:  shafwanur010
 *    created: 05/11/2020 6:55:04 PM (Bangladesh Standard Time)
**/
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
  #include "header.h"
#else
  #include "icc.h"
#endif

void run(int n) {
  set<pair<int, int>> st;
  while (true) {
    for (int u = 1; u <= n; u++) {
      for (int v = u + 1; v <= n; v++) {
        int a[] = {u};
        int b[] = {v};
        if (st.count({u, v}) == 0) {
          int ret = query(1, 1, a, b);
          if (ret) {
            setRoad(u, v);
            st.emplace(u, v);
          }
        }
      }
    }
  }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 616 KB Ok! 1301 queries used.
2 Incorrect 16 ms 484 KB Wrong road!

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 304 ms 564 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 503 ms 612 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 463 ms 612 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 417 ms 612 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 382 ms 612 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -