제출 #1175181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1175181		wernklung	Cluedo (IOI10_cluedo)	C++20	100 / 100	3 ms	392 KiB

cluedo

#include "grader.h"
#include "cluedo.h"

void Solve() {
   int m_candidates[6] = {1, 2, 3, 4, 5, 6};
   int l_candidates[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
   int w_candidates[6] = {1, 2, 3, 4, 5, 6};

   int m_size = 6;
   int l_size = 10;
   int w_size = 6;

   while (1) {
       int m = m_candidates[0];
       int l = l_candidates[0];
       int w = w_candidates[0];

       int result = Theory(m, l, w);

       if (result == 0) {
           break;
       } else if (result == 1) {
           for (int i = 0; i < m_size; i++) {
               if (m_candidates[i] == m) {
                   for (int j = i; j < m_size - 1; j++) {
                       m_candidates[j] = m_candidates[j + 1];
                   }
                   m_size--;
                   break;
               }
           }
       } else if (result == 2) {
           for (int i = 0; i < l_size; i++) {
               if (l_candidates[i] == l) {
                   for (int j = i; j < l_size - 1; j++) {
                       l_candidates[j] = l_candidates[j + 1];
                   }
                   l_size--;
                   break;
               }
           }
       } else if (result == 3) {
           for (int i = 0; i < w_size; i++) {
               if (w_candidates[i] == w) {
                   for (int j = i; j < w_size - 1; j++) {
                       w_candidates[j] = w_candidates[j + 1];
                   }
                   w_size--;
                   break;
               }
           }
       }
   }
}

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50