oj.uz

답안 #197983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197983 2020-01-24T12:39:37 Z model_code Drvca (COCI19_drvca) C++17
20 / 110
 6 ms 504 KB 
#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.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 6 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 424 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 6 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 424 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 504 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 6 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 424 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 504 KB Output isn't correct
16 Halted 0 ms 0 KB -