Submission #857128

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
857128	2023-10-05T12:05:50 Z	hariaakas646	Kas (COCI17_kas)	C++17	100 / 100	526 ms	394788 KB

#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

int main() {
    // usaco();
    int n;
    scd(n);
    vi vec(n+1);
    int tot = 0;
    forr(i, 1, n+1) {
        scd(vec[i]);
        tot += vec[i];
    }
    vector<vi> dp(n+1, vi(2e5+1, -1e9));

    dp[0][1e5] = 0;
    forr(i, 1, n+1) {
        forr(j, -1e5, 1e5+1) {
            dp[i][j+1e5] = dp[i-1][j+1e5];
            if(j - vec[i] >= -1e5) {
                dp[i][j+1e5] = max(dp[i][j+1e5], dp[i-1][j-vec[i] + 1e5] + vec[i]);
            }
            if(j + vec[i] <= 1e5) {
                dp[i][j+1e5] = max(dp[i][j+1e5], dp[i-1][j+vec[i] + 1e5] + vec[i]);
            }
        }
    }

    int ma = dp[n][1e5];
    printf("%d", ma / 2 + (tot - ma));
}

Compilation message

kas.cpp: In function 'void usaco()':
kas.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
kas.cpp: In function 'int main()':
kas.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
kas.cpp:37:5: note: in expansion of macro 'scd'
   37 |     scd(n);
      |     ^~~
kas.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
kas.cpp:41:9: note: in expansion of macro 'scd'
   41 |         scd(vec[i]);
      |         ^~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	9816 KB	Output is correct
2	Correct	11 ms	9820 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	9820 KB	Output is correct
2	Correct	11 ms	9820 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	9820 KB	Output is correct
2	Correct	12 ms	10588 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	11352 KB	Output is correct
2	Correct	18 ms	12120 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	12124 KB	Output is correct
2	Correct	14 ms	12180 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	29276 KB	Output is correct
2	Correct	42 ms	33372 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	48 ms	37208 KB	Output is correct
2	Correct	52 ms	41048 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	206 ms	159064 KB	Output is correct
2	Correct	270 ms	198176 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	310 ms	237652 KB	Output is correct
2	Correct	409 ms	316112 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	467 ms	355396 KB	Output is correct
2	Correct	526 ms	394788 KB	Output is correct