oj.uz

Submission #70693

# Submission time Handle Problem Language Result Execution time Memory
70693 2018-08-23T08:47:18 Z Just_Solve_The_Problem Park (JOI17_park) C++11
10 / 100
 13 ms 856 KB 
#include <bits/stdc++.h>
#include "park.h"

using namespace std;

static int Place[1400];
int n;

void solve1() {
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      Place[i] = Place[j] = 1;
      if (Ask(i, j, Place)) {
        Answer(i, j);
      }
      Place[i] = Place[j] = 0;
    }
  }
}

void Detect(int T, int N) {
  n = N;
  if (T == 1) {
    solve1();
  } else if (T == 2) {

  } else {

  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 10 ms 464 KB Output is correct
3 Correct 12 ms 468 KB Output is correct
4 Correct 10 ms 684 KB Output is correct
5 Correct 13 ms 716 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 716 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 716 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 716 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 856 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -