제출 #1105908

#제출 시각아이디문제언어결과실행 시간메모리
1105908KasymKKpart (eJOI21_kpart)C++17
30 / 100
2031 ms1348 KiB
#include "bits/stdc++.h" 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; }

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void solve(int)':
Main.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     scanf("%d", &tt);
      |     ~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...