제출 #674710

#제출 시각아이디문제언어결과실행 시간메모리
674710rafatoaKamenčići (COCI21_kamencici)C++17
70 / 70
133 ms336032 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize ("Ofast") #define F first #define S second #define vi vector<int> #define vvi vector<vi> #define pi pair<int, int> #define vpi vector<pi> #define vb vector<bool> #define vvb vector<vb> #define pb push_back #define ppb pop_back #define read(a) for(auto &x:a) cin >> x; #define print(a) for(auto x:a) cout << x << " "; cout << "\n"; #define vc vector<char> #define vvc vector<vc> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define int long long #define ld long double const int INF = 4e18; int n, k; string s; vi pref; const int N = 350; int dp[N][N][N]; bool win(int l, int r, int cnt){ if(cnt >= k) return dp[l][r][cnt] = 0; int h = pref[n]-(pref[r+1]-pref[l])-cnt; if(h >= k) return dp[l][r][cnt] = 1; if(dp[l+1][r][h] == -1) dp[l+1][r][h] = win(l+1, r, h); if(!dp[l+1][r][h]) return 1; if(dp[l][r-1][h] == -1) dp[l][r-1][h] = win(l, r-1, h); if(!dp[l][r-1][h]) return 1; return 0; } void solve(){ cin >> n >> k >> s; pref = vi(n+1); for(int i=0; i<N; i++) for(int j=0; j<N; j++) for(int k=0; k<N; k++) dp[i][j][k] = -1; for(int i=0; i<n; i++) pref[i+1] = pref[i]+(s[i] == 'C' ? 1 : 0); cout << (win(0, n-1, 0) ? "DA\n" : "NE\n"); } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); // #ifndef ONLINE_JUDGE // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); // #endif int tt = 1; // cin >> tt; while(tt--) solve(); return 0; }

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

Main.cpp: In function 'bool win(long long int, long long int, long long int)':
Main.cpp:34:39: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   34 |     if(cnt >= k) return dp[l][r][cnt] = 0;
      |                         ~~~~~~~~~~~~~~^~~
Main.cpp:36:37: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   36 |     if(h >= k) return dp[l][r][cnt] = 1;
      |                       ~~~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...