제출 #443142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443142		Dipto_Debdip	Drvca (COCI19_drvca)	C++14	0 / 110	1094 ms	142408 KiB

drvca

#include "bits/stdc++.h"
using namespace std;
#define ll long long int
bool chk(vector<ll> v) {
  set<ll> st;
  for (ll i = 0; i < (ll) (v.size()) - 1; i++) {
    st.insert(v[i] - v[i + 1]);
  }
  return (st.size() == 1 || st.size() == 0);
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n, k;
  vector<ll> v;
  map<ll, ll> mp;
  cin >> n;
  for (ll i = 0; i < n; i++) {
    cin >> k;
    mp[k]++;
    v.push_back(k);
  }
  set<ll> st;
  sort(v.begin(), v.end());
  for (ll i = 0; i < n; i++) {
    for (ll j = i + 1; j < n; j++) {
      st.insert(v[j] - v[i]);
    }
  }
  ll f = 0;
  for (ll c : st) {
    if (c == 0) continue;
    //cout << "c = " << c << endl;
    for (ll i = 0; i < n; i++) {
      vector<ll> f = {v[i]};
      map<ll, ll> mp2;
      mp2[v[i]]++;
      ll ff = 2;
      while (ff) {
        map<ll, ll> cop;
        for (ll jj : f) cop[jj]++;
        vector<ll> s;
        for (ll j : v) {
          if (cop[j]) cop[j]--;
          else s.push_back(j);
        }
        //cout << "hi" << endl;
        //s.erase(s.begin());
        if (chk(s) && chk(f) && (ll) (s.size() + (ll) f.size()) == n) {
          cout << f.size() << endl;
          for (ll ii : f) cout << ii << " ";
          cout << endl;
          cout << s.size() << endl;
          for (ll jj : s) cout << jj << " ";
          cout << endl;
          return 0;
        }
        if (mp[f.back() + c] == 0) ff--;
        else f.push_back(f.back() + c);
      }
    }
  }
  if (*st.begin() == 0 && st.size() == 1) {
    cout << 1 << " " << v[0] << endl;
    cout << n - 1 << endl;
    for (ll i = 1; i < n; i++) cout << v[i] << " ";
    cout << endl;
    return 0;
  }
  cout << -1 << endl;
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

drvca.cpp: In function 'int main(int, const char**)':
drvca.cpp:30:6: warning: unused variable 'f' [-Wunused-variable]
   30 |   ll f = 0;
      |      ^

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