| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 244839 |
2020-07-05T07:11:18 Z |
leaked |
Kas (COCI17_kas) |
C++14 |
|
0 ms |
0 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#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(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << 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 s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????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) (ll)x.size()
#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; }
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 R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e5+1;
const int M=1e9+7;
signed main(){
fast_io;
int n;
cin>>n;
ll sum=0;
vector<ll>a(n);
for(auto &z : a) cin>>z,sum+=z;
vector<pll>dp(2*sum+1,m_p(-1e9,-1e9));
dp[sum]=m_p(0,0);
for(int i=0;i<n;i++){
vector<pll>ndp(2*sum+1,m_p(-1e9,-1e9));
for(int j=0;j<=2*sum;j++){
ll f=dp[j].f,s=dp[j].s;
if(j>=a[i])ndp[j-a[i]]=max(ndp[j-a[i]],m_p(f,s+a[i]));
if(j+a[i]<=2*sum)ndp[j+a[i]]=max(ndp[j+a[i]],m_p(f+a[i],s));
ndp[j]=max(dp[j],ndp[j]);
ndp[j]=max(ndp[j],m_p(f,s));
}
dp=ndp;
}
// debug()<<imie(dp);
//for(auto &z : dp) cout<<z.f<<' '<<z.s<<endl;
// for(int i=0;i<=2*sum;i++){
// // cout<<"F"<<i<<' '<<dp[i].f<<' '<<dp[i].s<<endl;
// if(dp[i].f==dp[i].s) cout<<i<<' '<<dp[i].f<<endl;
// }
//cout<<sum<<' '<<dp[sum].f;
cout<<sum-dp[sum].f;
return 0;
}
///stuff you should look for :
/*
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* read the conditions carefully
* WRITE STUFF DOWN
*/
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#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(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << 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 s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????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) (ll)x.size()
#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; }
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 R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e5+1;
const int M=1e9+7;
signed main(){
fast_io;
int n;
cin>>n;
ll sum=0;
vector<ll>a(n);
for(auto &z : a) cin>>z,sum+=z;
vector<pll>dp(2*sum+1,m_p(-1e9,-1e9));
dp[sum]=m_p(0,0);
for(int i=0;i<n;i++){
vector<pll>ndp(2*sum+1,m_p(-1e9,-1e9));
for(int j=0;j<=2*sum;j++){
ll f=dp[j].f,s=dp[j].s;
if(j>=a[i])ndp[j-a[i]]=max(ndp[j-a[i]],m_p(f,s+a[i]));
if(j+a[i]<=2*sum)ndp[j+a[i]]=max(ndp[j+a[i]],m_p(f+a[i],s));
ndp[j]=max(dp[j],ndp[j]);
ndp[j]=max(ndp[j],m_p(f,s));
}
dp=ndp;
}
// debug()<<imie(dp);
//for(auto &z : dp) cout<<z.f<<' '<<z.s<<endl;
// for(int i=0;i<=2*sum;i++){
// // cout<<"F"<<i<<' '<<dp[i].f<<' '<<dp[i].s<<endl;
// if(dp[i].f==dp[i].s) cout<<i<<' '<<dp[i].f<<endl;
// }
//cout<<sum<<' '<<dp[sum].f;
cout<<sum-dp[sum].f;
return 0;
}
///stuff you should look for :
/*
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* read the conditions carefully
* WRITE STUFF DOWN
*/
Compilation message
kas.cpp:135:14: error: redefinition of 'struct rge<c>'
sim > struct rge { c b, e; };
^~~
kas.cpp:17:14: note: previous definition of 'struct rge<c>'
sim > struct rge { c b, e; };
^~~
kas.cpp:136:14: error: redefinition of 'template<class c> rge<c> range(c, c)'
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
^~~~~
kas.cpp:18:14: note: 'template<class c> rge<c> range(c, c)' previously declared here
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
^~~~~
kas.cpp:139:8: error: redefinition of 'struct debug'
struct debug {
^~~~~
kas.cpp:21:8: note: previous definition of 'struct debug'
struct debug {
^~~~~
kas.cpp:182:4: error: redefinition of 'long double eps'
ld eps = (ld)1 / 1e6;
^~~
kas.cpp:64:4: note: 'long double eps' previously defined here
ld eps = (ld)1 / 1e6;
^~~
kas.cpp:183:10: error: redefinition of 'const long double pi'
const ld pi=3.14159265359;
^~
kas.cpp:65:10: note: 'const long double pi' previously defined here
const ld pi=3.14159265359;
^~
kas.cpp:184:4: error: redefinition of 'long long int inf'
ll inf = 1e18,mod1=1e9+7;
^~~
kas.cpp:66:4: note: 'long long int inf' previously defined here
ll inf = 1e18,mod1=1e9+7;
^~~
kas.cpp:184:15: error: redefinition of 'long long int mod1'
ll inf = 1e18,mod1=1e9+7;
^~~~
kas.cpp:66:15: note: 'long long int mod1' previously defined here
ll inf = 1e18,mod1=1e9+7;
^~~~
kas.cpp: In function 'long long int sqr(long long int)':
kas.cpp:185:4: error: redefinition of 'long long int sqr(long long int)'
ll sqr(ll a) { return a * a; }
^~~
kas.cpp:67:4: note: 'long long int sqr(long long int)' previously defined here
ll sqr(ll a) { return a * a; }
^~~
kas.cpp: In function 'long long int qb(long long int)':
kas.cpp:186:4: error: redefinition of 'long long int qb(long long int)'
ll qb(ll a) { return a * a * a; }
^~
kas.cpp:68:4: note: 'long long int qb(long long int)' previously defined here
ll qb(ll a) { return a * a * a; }
^~
kas.cpp: In function 'long long int gcd(long long int, long long int)':
kas.cpp:187:4: error: redefinition of 'long long int gcd(long long int, long long int)'
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
^~~
kas.cpp:69:4: note: 'long long int gcd(long long int, long long int)' previously defined here
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
^~~
kas.cpp: In function 'long long int binpow(long long int, long long int, long long int)':
kas.cpp:188:4: error: redefinition of 'long long int binpow(long long int, long long int, long long int)'
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; }
^~~~~~
kas.cpp:70:4: note: 'long long int binpow(long long int, long long int, long long int)' previously defined here
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; }
^~~~~~
kas.cpp: In function 'long long int binmult(long long int, long long int, long long int)':
kas.cpp:189:4: error: redefinition of 'long long int binmult(long long int, long long int, long long int)'
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; }
^~~~~~~
kas.cpp:71:4: note: 'long long int binmult(long long int, long long int, long long int)' previously defined here
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; }
^~~~~~~
kas.cpp: At global scope:
kas.cpp:191:10: error: redefinition of 'const long long int R'
const ll R=1e4;
^
kas.cpp:73:10: note: 'const long long int R' previously defined here
const ll R=1e4;
^
kas.cpp:192:14: error: redefinition of 'const long long int tx [4]'
const ll tx[4]={0,0,-1,1};
^
kas.cpp:74:10: note: 'const long long int tx [4]' previously defined here
const ll tx[4]={0,0,-1,1};
^~
kas.cpp:193:14: error: redefinition of 'const long long int ty [4]'
const ll ty[4]={-1,1,0,0};
^
kas.cpp:75:10: note: 'const long long int ty [4]' previously defined here
const ll ty[4]={-1,1,0,0};
^~
kas.cpp:194:20: error: redefinition of 'const char rev_to [4]'
const char rev_to[4]={'E','W','N','S'};
^
kas.cpp:76:12: note: 'const char rev_to [4]' previously defined here
const char rev_to[4]={'E','W','N','S'};
^~~~~~
kas.cpp:195:11: error: redefinition of 'const int N'
const int N=1e5+1;
^
kas.cpp:77:11: note: 'const int N' previously defined here
const int N=1e5+1;
^
kas.cpp:196:11: error: redefinition of 'const int M'
const int M=1e9+7;
^
kas.cpp:78:11: note: 'const int M' previously defined here
const int M=1e9+7;
^
kas.cpp: In function 'int main()':
kas.cpp:197:8: error: redefinition of 'int main()'
signed main(){
^~~~
kas.cpp:79:8: note: 'int main()' previously defined here
signed main(){
^~~~
