제출 #234737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
234737		anayk	Memory 2 (JOI16_memory2)	C++14	10 / 100	5 ms	384 KiB

memory2

#include "Memory2_lib.h"
#include <vector>

void Solve(int T, int N){
  while(T--) {
    std::vector<int> ans(2*N, -1);

    int x = 0, y = 1, z = -1;
    int lastComp = Flip(x, y);

    for(int i = 2; i < 2*N; i++) {
      int xComp = Flip(i, x);
      int yComp = Flip(i, y);

      if(z == -1) {
        if(xComp == lastComp && yComp != lastComp) {
          lastComp = yComp;
          x = i;
        }
        else if(yComp == lastComp && xComp != lastComp) {
          lastComp = xComp;
          y = i;
        }
        else if(xComp == lastComp && yComp == lastComp) {
          z = i;
        }
      }
      else {
        if(xComp == lastComp && yComp == lastComp) {
          ans[x] = ans[y] = lastComp;
          x = z;
          y = i;
          z = -1;
          lastComp = Flip(x, y);
        }
        else if(xComp == lastComp && yComp != lastComp) {
          x = i;
          z = -1;
          lastComp = yComp;
        }
        else if(xComp != lastComp && yComp == lastComp) {
          y = i;
          z = -1;
          lastComp = xComp;
        }
      }
    }

    ans[x] = ans[y] = lastComp;

    std::vector<std::vector<int> > output(N);
    for(int i = 0; i < 2*N; i++) {
      if(ans[i] == -1)
        ans[i] = Flip(x, i);

      output[ans[i]].push_back(i);
    }

    for(int i = 0; i < N; i++)
      Answer(output[i][0], output[i][1], i);
  }
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 50
• Subtask 3: 0 / 40