oj.uz

Submission #71351

# Submission time Handle Problem Language Result Execution time Memory
71351 2018-08-24T11:29:45 Z Talant Park (JOI17_park) C++17
10 / 100
 56 ms 752 KB 
#include "park.h"
//#include "grader.cpp"

#include <bits/stdc++.h>

#define pb push_back
#define sc second
#define fr first
#define mk make_pair

using namespace std;

static int Place[1400];

void Detect(int T, int n) {
      for (int i = 0; i < n; i ++) {
            for (int j = i + 1; j < n; j ++) {
                  Place[i] = 1;
                  Place[j] = 1;

                  if (Ask(i,j,Place)) Answer(i,j);

                  Place[i] = 0;
                  Place[j] = 0;
            }
      }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 11 ms 360 KB Output is correct
3 Correct 10 ms 400 KB Output is correct
4 Correct 11 ms 404 KB Output is correct
5 Correct 13 ms 616 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 708 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 708 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 708 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 752 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -