oj.uz

Submission #70699

# Submission time Handle Problem Language Result Execution time Memory
70699 2018-08-23T08:56:04 Z Just_Solve_The_Problem Park (JOI17_park) C++11
10 / 100
 11 ms 628 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;
    }
  }
}

int used[1400];
int deg[1400];

void solve2() {
  vector < int > vec(n);
  iota(vec.begin(), vec.end(), 0);
  random_shuffle(vec.begin(), vec.end());
  for (int i = 0; i < n; i++) {
    if (deg[vec[i]] > 1) continue;
    for (int j = 0; j < n; j++) {
      if (used[vec[j]]) continue;
      Place[vec[i]] = Place[vec[j]] = 1;
      if (Ask(vec[i], vec[j], Place)) {
        Answer(vec[i], vec[j]);
        deg[vec[i]]++;
        deg[vec[j]]++;
        used[vec[j]] = 1;
        used[vec[i]] = 1;
      }
      Place[vec[i]] = Place[vec[j]] = 0;
    }
  }
}

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

  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 9 ms 376 KB Output is correct
3 Correct 9 ms 544 KB Output is correct
4 Correct 9 ms 544 KB Output is correct
5 Correct 11 ms 544 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 544 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 23.0

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