제출 #646030

#제출 시각아이디문제언어결과실행 시간메모리
646030ghostwriterMiners (IOI07_miners)C++14
100 / 100
206 ms100480 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #else #define debug(...) #endif #define ft front #define bk back #define st first #define nd second #define ins insert #define ers erase #define pb push_back #define pf push_front #define _pb pop_back #define _pf pop_front #define lb lower_bound #define ub upper_bound #define mtp make_tuple #define bg begin #define ed end #define all(x) (x).bg(), (x).ed() #define sz(x) (int)(x).size() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef string str; template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i)) #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i)) #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i)) #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i)) #define EACH(i, x) for (auto &(i) : (x)) #define WHILE while #define file "TEST" mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); } /* ---------------------------------------------------------------- END OF TEMPLATE ---------------------------------------------------------------- Tran The Bao - ghostwriter Training for VOI23 gold medal ---------------------------------------------------------------- DIT ME CHUYEN BAO LOC ---------------------------------------------------------------- */ #define getid(x) (x == 'M'? 0 : x == 'F'? 1 : x == 'B'? 2 : 3) #define cost(a, b, c) ((a != 3 && a != b && a != c) + (b != 3 && b != c) + (c != 3)) const int N = 1e5 + 1; int n, d[N][4][4][4][4]; char s[N]; signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); // freopen(file".inp", "r", stdin); // freopen(file".out", "w", stdout); cin >> n; FOR(i, 0, n - 1) cin >> s[i]; FSN(i, n) FSN(s1, 4) FSN(s2, 4) FSN(s3, 4) FSN(s4, 4) { int &rs = d[i][s1][s2][s3][s4], id = getid(s[i]); rs = max(rs, d[i + 1][id][s1][s3][s4] + cost(id, s1, s2)); rs = max(rs, d[i + 1][s1][s2][id][s3] + cost(id, s3, s4)); } cout << d[0][3][3][3][3]; return 0; } /* 6 MBMFFB ---------------------------------------------------------------- From Benq: stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN * DON'T GET STUCK ON ONE APPROACH ---------------------------------------------------------------- */

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

miners.cpp: In function 'int main()':
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:61:5: note: in expansion of macro 'FOR'
   61 |     FOR(i, 0, n - 1) cin >> s[i];
      |     ^~~
miners.cpp:35:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   35 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
miners.cpp:62:5: note: in expansion of macro 'FSN'
   62 |     FSN(i, n)
      |     ^~~
miners.cpp:35:28: warning: unnecessary parentheses in declaration of 's1' [-Wparentheses]
   35 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
miners.cpp:63:5: note: in expansion of macro 'FSN'
   63 |     FSN(s1, 4)
      |     ^~~
miners.cpp:35:28: warning: unnecessary parentheses in declaration of 's2' [-Wparentheses]
   35 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
miners.cpp:64:5: note: in expansion of macro 'FSN'
   64 |     FSN(s2, 4)
      |     ^~~
miners.cpp:35:28: warning: unnecessary parentheses in declaration of 's3' [-Wparentheses]
   35 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
miners.cpp:65:5: note: in expansion of macro 'FSN'
   65 |     FSN(s3, 4)
      |     ^~~
miners.cpp:35:28: warning: unnecessary parentheses in declaration of 's4' [-Wparentheses]
   35 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
miners.cpp:66:5: note: in expansion of macro 'FSN'
   66 |     FSN(s4, 4) {
      |     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...