답안 #544492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544492 2022-04-02T06:42:00 Z SmolBrain Kas (COCI17_kas) C++17
70 / 100
164 ms 108704 KB
// Om Namah Shivaya
// GM in 122 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

bool dp[55][1005][1005];

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n + 5);
    rep1(i, n) cin >> a[i];

    dp[0][0][0] = 1;

    rep1(i, n) {
        ll x = a[i];

        rep(j, 1001) {
            rep(k, 1001) {
                // give to person 1
                if (j - x >= 0) {
                    dp[i][j][k] |= dp[i - 1][j - x][k];
                }

                // give to person 2
                if (k - x >= 0) {
                    dp[i][j][k] |= dp[i - 1][j][k - x];
                }

                // ignore
                dp[i][j][k] |= dp[i - 1][j][k];
            }
        }
    }

    ll sum = 0;
    rep1(i, n) sum += a[i];

    rev(k, 1000, 0) {
        if (dp[n][k][k]) {
            ll ans = k + (sum - (k * 2));
            cout << ans << endl;
            return;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

kas.cpp: In function 'void usaco(std::string)':
kas.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kas.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 10188 KB Output is correct
2 Correct 21 ms 10144 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 10084 KB Output is correct
2 Correct 23 ms 10196 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 10188 KB Output is correct
2 Correct 24 ms 11208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 12108 KB Output is correct
2 Correct 34 ms 13132 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13172 KB Output is correct
2 Correct 29 ms 13156 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 34904 KB Output is correct
2 Correct 107 ms 39792 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 44744 KB Output is correct
2 Correct 139 ms 49692 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 164 ms 108680 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 158 ms 108560 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 163 ms 108704 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -