제출 #197983

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197983		model_code	Drvca (COCI19_drvca)	C++17	20 / 110	6 ms	504 KiB

drvca

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair
#define pb push_back

const int MAXN = 30;

int n, p[MAXN];

int main() {
  cin >> n;
  if (n > 25 || n == 1) {
    puts("-1");
    return 0;
  }
  REP(i, n) cin >> p[i];
  sort(p, p + n);

  vector <int> v[2];
  FOR(mask, 1, (1 << n) - 1) {
    REP(j, 2) v[j].clear();
    REP(i, n) {
      if (mask & (1 << i)) v[1].pb(p[i]);
      else v[0].pb(p[i]);
    }

    bool ok = 1;
    REP(j, 2) FOR(i, 1, (int)v[j].size()) if (v[j][i] - v[j][i - 1] != v[j][1] - v[j][0]) ok = 0;
    if (ok) {
      REP(i, 2) {
        printf("%d\n",(int)v[i].size());
        for (auto x : v[i]) printf("%d ", x);
        puts("");
      }
      return 0;
    }
  }
  puts("-1");
  return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30