Torni

input/code.cpp: In function 'bool solve(std::vector<int>, int, std::vector<int>&)':
input/code.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i+1 < ans.size(); ++i) {
                    ~~~~^~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:36:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 2; i < b.size(); ++i) {
                  ~~^~~~~~~~~~
input/code.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < result.size(); ++i) {
                  ~~^~~~~~~~~~~~~~~

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
bool solve(vector<int> b, int a1, vector<int>& out) {
  multiset<int> b_set(b.begin(), b.end());
  vector<int> ans;
  ans.push_back(a1);
  while(b_set.size()) {
    int b_smallest = *b_set.begin();
    ans.push_back(b_smallest - ans[0]);
    for(int i = 0; i+1 < ans.size(); ++i) {
      int x = ans[i] + ans.back();
      auto x_it = b_set.find(x);
      if(x_it == b_set.end()) {
        return false;
      }
      b_set.erase(x_it);
    }
  }
  out = ans;
  return true;
}
int main() {
  int n;
  cin>>n;
  vector<int> b;
  for(int i = 0; i < n*(n-1)/2; ++i) {
    int x;
    cin>>x;
    b.push_back(x);
  }
  sort(b.begin(), b.end());
  vector<int> result;
  for(int i = 2; i < b.size(); ++i) {
    int a1 = (b[0] + b[1] - b[i])/2;
    if(solve(b, a1, result)) {
      break;
    }
  }
  for(int i = 0; i < result.size(); ++i) {
    cout<<result[i]<<' ';
  }
  cout<<'\n';
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED