oj.uz

Submission #940583

# Submission time Handle Problem Language Result Execution time Memory
940583 2024-03-07T11:02:39 Z Sundavar Monster Game (JOI21_monster) C++17
0 / 100
 13 ms 8504 KB 
#include "monster.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(423423432);

vector<vector<int> > m(1000, vector<int>(1000, -1));
bool ask(int a, int b){
  if(m[a][b] == -1){
    m[a][b] = Query(a,b);
    m[b][a] = 1 - m[a][b];
  }
  return m[a][b];
}

vector<int> solve(vector<int> v){
  int N = v.size();
  if(N <= 12){
    vector<pair<int,int> > cnt(N);
    vector<int> amb1, amb2;
    for(int i = 0; i < N; i++){
      cnt[i].second = v[i];
      for(int j = 0; j < i; j++)
        if(j != i){
          if(ask(v[i],v[j])) cnt[i].first++;
          else cnt[j].first++;
        }
    }
    sort(cnt.begin(), cnt.end());
    if(cnt[0].first == cnt[1].first){
      if(!ask(cnt[0].second,cnt[1].second)) swap(cnt[0], cnt[1]);
    }
    if(cnt[1].first == cnt[2].first){
      if(!ask(cnt[1].second,cnt[2].second)) swap(cnt[1], cnt[2]);
    }
    if(cnt[N-2].first == cnt[N-1].first){
      if(!ask(cnt[N-2].second,cnt[N-1].second)) swap(cnt[N-2], cnt[N-1]);
    }
    if(cnt[N-3].first == cnt[N-2].first){
      if(!ask(cnt[N-3].second,cnt[N-2].second)) swap(cnt[N-3], cnt[N-2]);
    }
    vector<int> res;
    for(pair<int,int>& a : cnt) res.push_back(a.second);
    return res;
  }
  vector<int> left, right;
  int m = rng()%N;
  while(true){
    left.clear(), right.clear();
    for(int i = 0; i < N; i++)
      if(i != m){
        if(ask(v[m], v[i])) left.push_back(v[i]);
        else right.push_back(v[i]);
      }
    if(min(left.size(), right.size()) <= 4){
      m = rng()%N;
      continue;
    }
    break;
  }
  left = solve(left), right = solve(right);
  if(!ask(left[left.size()-1], v[m])) swap(left[left.size()-1], right[0]);
  vector<int> res;
  for(int& a : left) res.push_back(a);
  res.push_back(v[m]);
  for(int& a : right) res.push_back(a);
  
}

std::vector<int> Solve(int N) {
  vector<int> v;
  for(int i = 0; i < N ; i++) v.push_back(i);
  v = solve(v);
  vector<int> T(N);
  for(int i = 0; i < N; i++) T[v[i]] = i;
  return T;
}

Compilation message

monster.cpp: In function 'std::vector<int> solve(std::vector<int>)':
monster.cpp:46:15: warning: control reaches end of non-void function [-Wreturn-type]
   46 |   vector<int> left, right;
      |               ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 4184 KB Output is correct
3 Correct 2 ms 4184 KB Output is correct
4 Correct 2 ms 4184 KB Output is correct
5 Correct 2 ms 4184 KB Output is correct
6 Correct 2 ms 4184 KB Output is correct
7 Correct 2 ms 4184 KB Output is correct
8 Correct 3 ms 4184 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4184 KB Output is correct
11 Correct 2 ms 4184 KB Output is correct
12 Correct 2 ms 4184 KB Output is correct
13 Correct 2 ms 4184 KB Output is correct
14 Correct 2 ms 4184 KB Output is correct
15 Correct 3 ms 4184 KB Output is correct
16 Runtime error 7 ms 8496 KB Execution killed with signal 6
17 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 4184 KB Output is correct
3 Correct 2 ms 4184 KB Output is correct
4 Correct 2 ms 4184 KB Output is correct
5 Correct 2 ms 4184 KB Output is correct
6 Correct 2 ms 4184 KB Output is correct
7 Correct 2 ms 4184 KB Output is correct
8 Correct 3 ms 4184 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4184 KB Output is correct
11 Correct 2 ms 4184 KB Output is correct
12 Correct 2 ms 4184 KB Output is correct
13 Correct 2 ms 4184 KB Output is correct
14 Correct 2 ms 4184 KB Output is correct
15 Correct 3 ms 4184 KB Output is correct
16 Runtime error 7 ms 8496 KB Execution killed with signal 6
17 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 8504 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -