oj.uz

답안 #1105909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105909 2024-10-28T10:15:02 Z KasymK Kpart (eJOI21_kpart) C++17
100 / 100
 1931 ms 1376 KB 
#include "bits/stdc++.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}

void solve(int green_flecks){
    int n;
    scanf("%d", &n);
    vector<int> v(n+1), par(n+1, 0);
    vector<bool> ok(n+1, true);
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        v[i] = x, par[i] = par[i-1]+x;
    }
    vector<int> dp(par[n]+1, 0);
    for(int i = 1; i <= n; i++){
        vector<int> ndp = dp;
        for(int j = v[i]; j <= par[n]; ++j)
            umax(ndp[j], dp[j-v[i]]);
        ndp[v[i]] = i;
        dp = ndp;
        for(int j = i-1; j >= 1; j--){
            int sm = par[i]-par[j-1], k = i-j+1;
            if(sm&1 or dp[sm/2]<j)
                ok[k] = 0;
        }
    }
    vector<int> A;
    for(int i = 2; i <= n; ++i)
        if(ok[i])
            A.pb(i);
    printf("%d", (int)A.size());
    tr(it, A)
        printf(" %d", *it);
    puts("");
}
 
int main(){
    int tt;
    scanf("%d", &tt);
    while(tt--)
        solve(tt);
    return 0;
}

Compilation message

Main.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
Main.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
Main.cpp: In function 'void solve(int)':
Main.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     scanf("%d", &tt);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 508 KB Output is correct
2 Correct 34 ms 596 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 708 KB Output is correct
2 Correct 337 ms 712 KB Output is correct
3 Correct 329 ms 852 KB Output is correct
4 Correct 618 ms 868 KB Output is correct
5 Correct 1333 ms 1284 KB Output is correct
6 Correct 1931 ms 1248 KB Output is correct
7 Correct 1743 ms 1376 KB Output is correct