| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 312571 |
2020-10-13T17:44:57 Z |
leaked |
Drvca (COCI19_drvca) |
C++14 |
|
75 ms |
11256 KB |
#include<bits/stdc++.h>
using namespace std;
//#define int long long
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define vec multiset
#define s second
#define vi_a vector<int>a;
#define p_b insert
#define pb insert
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define int long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll RR=1e4;
const ll tx[8]={1,-1,2,-2,-1,-2};
const ll ty[8]={-2,-2,-1,-1,2,1};
const char rev_to[4]={'E','W','N','S'};
const int M=1e9+7;
const int N=3e2+3;
const int ppp=73;
const int K=2e5+2;
const int block=600;
const int OPEN=1;
const int CLOSE=0;
//typedef pair<long long,int> pli;
//typedef tree<pli,null_type,less<pli>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<int>(1,5969699),mt19937(time(0)));
void bad(){
cout<<"IMPOSSIBLE";
exit(0);
}
vector<int>a;
int n;
bool is(const vec<int> &a){
if(sz(a)==1)
return 1;
if(sz(a)==0)
return 0;
int d=*next(a.begin())-*a.begin();
auto it1=next(a.begin()),it=a.begin();
for(int i=2;i<sz(a);i++){
it1=next(it1);
it=next(it);
if((*it1-*it)!=d)
return 0;
}
return 1;
}
struct setik{
multiset<int>st;
set<int>dif;
map<int,int>kek;
void add(int vl){
auto it=st.lower_bound(vl);
if(it!=st.begin()){
it--;
dif.insert(vl-*it);
kek[vl-*it]++;
it++;
}
if(it!=st.end()){
dif.insert(*it-vl);
kek[*it-vl]++;
}
if(it!=st.begin() && it!=st.end()){
kek[*it-*prev(it)]--;
if(kek[*it-*prev(it)]==0)
dif.erase(*it-*prev(it));
}
st.insert(vl);
}
};
void prnt(vec<int> a,vec<int>b){
cout<<sz(a)<<endl;
for(auto &z : a) cout<<z<<' ';
cout<<endl;
cout<<sz(b)<<endl;
for(auto &z : b) cout<<z<<' ';
exit(0);
}
bool tre1(setik &f,setik & s){
while(sz(f.st)>1 && sz(s.dif)!=1){
int vl=*f.st.rbegin();
f.st.erase(--f.st.end());
s.add(vl);
}
if(sz(f.dif)==1 && sz(s.dif)==1){
// debug()<<imie(f.st);
assert(is(f.st));
prnt(f.st,s.st);
}
}
bool testcase(int st,int d1){
swap(st,d1);
setik f,s;
f.add(a[st]);
bool ok=1;
for(int i=0;i<n;i++){
if(i==st) continue;
if(a[i]-*f.st.rbegin()==d1){
f.add(a[i]);
}
else{
s.add(a[i]);
}
}
tre1(f,s);
}
signed main()
{
fast_io;
cin>>n;
a.resize(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
if(n==2){
cout<<1<<endl;
cout<<a[0]<<endl;
cout<<1<<endl;
cout<<a[1]<<endl;
exit(0);
}
sort(all(a));
testcase(a[1]-a[0],0);
testcase(a[2]-a[1],1);
testcase(a[2]-a[0],0);
cout<<-1;
return 0;
}
/*
15
999834725 999842153 999849581 999857009 999864437 999871865 999879293 999886721 999894149 999901577 999909005 999916433 999901579 999909005 999916431
*/
Compilation message
drvca.cpp: In function 'bool testcase(int, int)':
drvca.cpp:164:10: warning: unused variable 'ok' [-Wunused-variable]
164 | bool ok=1;
| ^~
drvca.cpp:175:1: warning: no return statement in function returning non-void [-Wreturn-type]
175 | }
| ^
drvca.cpp: In function 'bool tre1(setik&, setik&)':
drvca.cpp:159:1: warning: control reaches end of non-void function [-Wreturn-type]
159 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
65 ms |
11128 KB |
Output is correct |
| 2 |
Correct |
70 ms |
11256 KB |
Output is correct |
| 3 |
Correct |
75 ms |
11128 KB |
Output is correct |
| 4 |
Correct |
70 ms |
11256 KB |
Output is correct |
| 5 |
Correct |
68 ms |
11128 KB |
Output is correct |
| 6 |
Correct |
69 ms |
11128 KB |
Output is correct |
| 7 |
Correct |
66 ms |
11128 KB |
Output is correct |
| 8 |
Correct |
69 ms |
11172 KB |
Output is correct |
| 9 |
Correct |
69 ms |
10928 KB |
Output is correct |
| 10 |
Correct |
71 ms |
11128 KB |
Output is correct |
| 11 |
Correct |
57 ms |
11128 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
