oj.uz

답안 #776783

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776783 2023-07-08T09:12:09 Z mindiyak Memory (IOI10_memory) C++14
0 / 100
 1 ms 208 KB 
#include "grader.h"
#include "memory.h"
#include <vector>
#include <iostream>

using namespace std;

void play() {
   vector<int> left(26,-1);
   vector<int> right(26,-1);
   vector<bool> solved(26,false);
   for (int i=0;i<25;i++) {
      char a = faceup((i*2)+1);
      char b = faceup((i*2)+2);
      // cout << (i*2)+1 << " " << (i*2)+2 << " " << a << " " << b << endl;
      if(left[a-'A'] != -1){
         right[a-'A'] = (i*2)+1;
      }else{
         left[a-'A'] = (i*2)+1;
      }

      if(left[b-'A'] != -1){
         right[b-'A'] = (i*2)+2;
      }else{
         left[b-'A'] = (i*2)+2;
      }

      if(a==b){
         solved[a-'A'] = true;
      }
   }
   // for(int i = 0;i < 26;i++){
      // cout << left[i] << " " << right[i] << " " << solved[i] << endl;
   // }
   for(int i = 0;i < 26;i++){
      if(solved[i] == 0){
         faceup(left[i]);
         faceup(right[i]);
         solved[i] = true;
         // cout << left[i] << " " << right[i] << endl;
      }
   }
   // for(int i = 0;i < 26;i++){
   //    cout << left[i] << " " << right[i] << " " << solved[i] << endl;
   // }
}

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -