제출 #484841

#제출 시각아이디문제언어결과실행 시간메모리
484841dxz05JJOOII 2 (JOI20_ho_t2)C++14
100 / 100
10 ms1560 KiB
#pragma GCC optimize("Ofast,O2,O3,unroll-loops") #pragma GCC target("avx2") #include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << "[" << H << "]"; debug_out(T...); } #ifdef dddxxz #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define SZ(s) ((int)s.size()) #define all(x) (x).begin(), (x).end() #define lla(x) (x).rbegin(), (x).rend() clock_t startTime; double getCurrentTime() { return (double) (clock() - startTime) / CLOCKS_PER_SEC; } #define MP make_pair typedef long long ll; mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const double eps = 0.000001; const int MOD = 1e9 + 7; const int INF = 1000000101; const long long LLINF = 1223372000000000555; const int N = 1e6 + 3e2; const int M = 2222; int f(char c){ return (c == 'J' ? 0 : c == 'O' ? 1 : 2); } void solve(int TC) { int n, k; string s; cin >> n >> k >> s; deque<int> dq[3]; for (int i = 0; i < n; i++){ dq[f(s[i])].push_back(i + 1); } int ans = -1; for (int i = 1; i <= n; i++){ while (!dq[0].empty() && dq[0].front() < i) dq[0].pop_front(); if (dq[0].size() < k) break; int j = dq[0][k - 1]; while (!dq[1].empty() && dq[1].front() < j) dq[1].pop_front(); if (dq[1].size() < k) break; j = dq[1][k - 1]; while (!dq[2].empty() && dq[2].front() < j) dq[2].pop_front(); if (dq[2].size() >= k){ j = dq[2][k - 1]; if (ans == -1 || ans > j - i + 1 - 3 * k) ans = j - i + 1 - 3 * k; } } cout << ans; } int main() { startTime = clock(); ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); #ifdef dddxxz freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int TC = 1; // cin >> TC; for (int test = 1; test <= TC; test++) { debug(test); //cout << "Case #" << test << ": "; solve(test); } cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl; return 0; }

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

ho_t2.cpp: In function 'void solve(int)':
ho_t2.cpp:60:26: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |         if (dq[0].size() < k) break;
      |             ~~~~~~~~~~~~~^~~
ho_t2.cpp:65:26: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |         if (dq[1].size() < k) break;
      |             ~~~~~~~~~~~~~^~~
ho_t2.cpp:70:26: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   70 |         if (dq[2].size() >= k){
      |             ~~~~~~~~~~~~~^~~~
ho_t2.cpp: In function 'int main()':
ho_t2.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
ho_t2.cpp:93:9: note: in expansion of macro 'debug'
   93 |         debug(test);
      |         ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...