제출 #361191

#제출 시각아이디문제언어결과실행 시간메모리
361191HoneyBadgerJJOOII 2 (JOI20_ho_t2)C++17
100 / 100
10 ms3456 KiB
#include <iostream> #include <iomanip> #include <cstdio> #include <vector> #include <bitset> #include <string> #include <cstring> #include <map> #include <set> #include <stack> #include <queue> #include <deque> #include <utility> #include <algorithm> #include <random> #include <cmath> #include <cassert> #include <climits> #include <ctime> #include <chrono> /* #pragma GCC optimize("Ofast") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native") */ #ifdef LOCAL #define dbg(x) cout << #x << " : " << x << endl; #else #define dbg(x) #endif #define int long long #define pb push_back #define ppb pop_back() #define mp make_pair #define fi(a, b) for (int i = a; i < b; i++) #define fj(a, b) for (int j = a; j < b; j++) #define fk(a, b) for (int k = a; k < b; k++) #define fi1(a, b) for (int i = a - 1; i >= b; i--) #define fj1(a, b) for (int j = a - 1; j >= b; j--) #define fk1(a, b) for (int k = a - 1; k >= b; k--) #define fx(x, a) for (auto& x : a) #define rep(i, a, b) for (int i = a; i < b; ++i) #define rep1(i, a, b) for (int i = a - 1; i >= b; --i) #define siz(x) (int)x.size() #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() using namespace std; template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; } template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; } ostream& operator << (ostream &out, const vector<int> &b) { for (auto k : b) out << k << ' '; return out; } typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef char ch; typedef string str; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pii> vpii; typedef vector<vpii> vvpii; typedef vector<ch> vch; typedef vector<vch> vvch; typedef vector<str> vs; const int MOD = 1000000007; const int INF = 1000000050; const long long BIG = (long long)2e18 + 50; const int MX = 200010; const double EPS = 1e-9; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); vi in[3]; int it[3]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; str s; cin >> s; for (int i = 0; i < n; ++i) { if (s[i] == 'J') in[0].pb(i); else if (s[i] == 'O') in[1].pb(i); else in[2].pb(i); } int ans = INF; for (int i = 0; i < n - 2; ++i) { int cur = i; for (int c = 0; c < 3; ++c) { while (it[c] < in[c].size() && (it[c] < k - 1 || in[c][it[c] - k + 1] < cur)) ++it[c]; if (it[c] == in[c].size()) { cur = BIG; break; } cur = in[c][it[c]]; } mine(ans, cur - i + 1 - 3 * k); } cout << (ans == INF ? -1 : ans) << '\n'; }

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

ho_t2.cpp: In function 'int32_t main()':
ho_t2.cpp:115:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |       while (it[c] < in[c].size() && (it[c] < k - 1 || in[c][it[c] - k + 1] < cur))
      |              ~~~~~~^~~~~~~~~~~~~~
ho_t2.cpp:117:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |       if (it[c] == in[c].size()) {
      |           ~~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...