oj.uz

답안 #1004332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004332 2024-06-21T07:52:44 Z aykhn Trobojnica (COCI19_trobojnica) C++17
0 / 110
 0 ms 344 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define inf 0x3F3F3F3F3F3F3F3F
 
const int MXN = 20 + 5;
const int mod = 1e9 + 7;
const int LOG = 20;
 
int n;
vector<array<int, 3>> res;
 
int ok(vector<array<int, 3>> &v)
{
  if (v.size() == 3)
  {
    return v[0][0] != v[1][0] && v[0][0] != v[2][0] && v[1][0] != v[2][0];
  }
  for (int i = 0; i < v.size(); i++)
  {
    if (v[i][0] != v[(i + 1) % (int)v.size()][0])
    {
      vector<array<int, 3>> nw;
      for (int j = 0; j < v.size(); j++)
      {
        if (j != i && j != (i + 1) % (int)v.size())
        {
          nw.push_back(v[j]);
        }
        else if (j == i)
        {
          nw.push_back({6 - v[i][0] - v[(i + 1) % (int)v.size()][0], v[i][1], v[(i + 1) % (int)v.size()][2]});
        }
      }
      if (ok(nw))
      {
        res.push_back({v[i][1], v[(i + 1) % (int)v.size()][2], 6 - v[i][0] - v[(i + 1) % (int)v.size()][0]});
        return 1;
      }
      else return 0;
    }
  }
  return 0;
}
 
 
signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  vector<array<int, 3>> v;
  for (int i = 0; i < n; i++)
  {
    char ch;
    cin >> ch;
    v.push_back({ch - '0', i + 1, (i + 1) % n + 1});
  }
  if (!ok(v)) cout << "NE\n";
  else
  {
    cout << "DA\n";
    for (array<int, 3> &x : res) cout << x[0] << ' ' << x[1] << ' ' << x[2] << '\n';
  }
}

Compilation message

trobojnica.cpp: In function 'int ok(std::vector<std::array<int, 3> >&)':
trobojnica.cpp:20:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   for (int i = 0; i < v.size(); i++)
      |                   ~~^~~~~~~~~~
trobojnica.cpp:25:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |       for (int j = 0; j < v.size(); j++)
      |                       ~~^~~~~~~~~~

Subtask #1
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -