제출 #251455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251455		Bruteforceman	Trobojnica (COCI19_trobojnica)	C++11	60 / 110	14 ms	4496 KiB

trobojnica

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int suc[maxn];
int pre[maxn];
int succol[maxn], precol[maxn];

int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int freq[] = {0, 0, 0, 0};
  for(int i = 0; i < n; i++) {
    pre[i] = (n + i - 1) % n;
    suc[i] = (i + 1) % n;
    freq[s[i] - '0'] += 1;
    precol[i] = s[pre[i]] - '0';
    succol[i] = s[i] - '0';
  }
  if(freq[1] == n || freq[2] == n || freq[3] == n) {
    cout << "NE" << endl;
    exit(0);
  }
  if(abs(freq[1] - freq[2]) % 2 == 1 || abs(freq[2] - freq[3]) % 2 == 1) {
    cout << "NE" << endl;
    exit(0);
  }
  cout << "DA" << endl;
  int cur = 0;
  for(int i = 0; i < n - 3; i++) {
    int occur = max({freq[1], freq[2], freq[3]});
    int col;
    for(col = 1; col <= 3; col++) {
      if(freq[col] == occur) break;
    }
    while(true) {
      if(precol[cur] != succol[cur] && 
        (col == precol[cur] || col == succol[cur])) {
        int inv = 6 - precol[cur] - succol[cur];
        freq[precol[cur]] -= 1;
        freq[succol[cur]] -= 1;
        freq[inv] += 1;
        cout << pre[cur] + 1 << " " << suc[cur] + 1 << " " << inv << endl;
        pre[suc[cur]] = pre[cur]; precol[suc[cur]] = inv;
        suc[pre[cur]] = suc[cur]; succol[pre[cur]] = inv;
        cur = suc[cur];
        break; 
      } else {
        cur = suc[cur];
      }
    }
  }
  return 0;
}

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