oj.uz

답안 #72499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72499 2018-08-26T08:36:01 Z (#2175, xdoju, kazel, pps789) 통행이 제한된 저택 (FXCUP3_key) C++17
0 / 100
 3 ms 744 KB 
#include<bits/stdc++.h>
#include"key.h"
using namespace std;

int sz[1005], lft[1005];
int out[1005], mb[1005];
vector<int> cycle[1005];

void EnsureKeyInfo(int N){
  for(int i=1;i<=N;i++) {
    TakeKey(i);
    sz[i] = Explore();
    if(sz[i] == 1) out[i] = i;
    else lft[sz[i]]++;
  }
  for(int i=1;i<=N;i++) {
    if(mb[i] || out[i]) continue;
    vector<int> cand;
    if(lft[sz[i]-1]) {
      for(int j=1;j<=N;j++) {
        if(sz[j] == sz[i]-1) cand.push_back(j);
      }
      random_shuffle(cand.begin(), cand.end());
      for(int j : cand) {
        TakeKey(i);
        TakeKey(j);
        int ret = Explore();
        if(ret == sz[i]) {
          out[i] = j;
          break;
        }
      }
    }
    if(out[i]) {
      lft[sz[i]]--;
      continue;
    }
    if(lft[sz[i]] < sz[i]) continue;
    cand.clear();
    for(int j=i+1;j<=N;j++) {
      if(i == j) continue;
      if(sz[i] == sz[j] && !mb[j]) cand.push_back(j);
    }
    if(cand.size() == sz[i]-1) {
      cand.push_back(i);
      sort(cand.begin(), cand.end());
      int x = cand[0];
      for(int j : cand) {
        cycle[x].push_back(j);
        mb[j] = x;
      }
      continue;
    } else {
      vector<int> rcand;
      random_shuffle(cand.begin(), cand.end());
      for(int j : cand) {
        TakeKey(i);
        TakeKey(j);
        int ret = Explore();
        if(ret == sz[i]) rcand.push_back(j);
        if(rcand.size() == sz[i]-1) break;
      }
      rcand.push_back(i);
      sort(rcand.begin(), rcand.end());
      int x = rcand[0];
      for(int j : rcand) {
        cycle[x].push_back(j);
        mb[j] = x;
      }
    }
  }
  for(int i=1;i<=N;i++) {
    if(mb[i]) {
      if(cycle[i].empty()) continue;
      for(int x : cycle[i]) {
        for(int y : cycle[i]) {
          Report(x,y);
        }
      }
    } else {
      int prv = i;
      Report(i,i);
      int x = out[i];
      while(x != prv) {
        if(mb[x]) {
          for(int j : cycle[mb[x]]) {
            Report(i, j);
          }
          break;
        } else {
          Report(i, x);
          prv = x;
          x = out[x];
        }
      }
    }
  }
}

Compilation message

key.cpp: In function 'void EnsureKeyInfo(int)':
key.cpp:44:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(cand.size() == sz[i]-1) {
        ~~~~~~~~~~~~^~~~~~~~~~
key.cpp:61:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(rcand.size() == sz[i]-1) break;
            ~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 744 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -

Subtask #2
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 744 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 744 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -