# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257964 | 2020-08-05T06:32:32 Z | 임성재(#5053) | Toilets (JOI16_toilets) | C++17 | 3 ms | 3456 KB |
#include<bits/stdc++.h> using namespace std; #define fast ios::sync_with_stdio(false); cin.tie(NULL) #define fi first #define se second #define pb push_back #define eb emplace_back #define em emplace #define all(v) (v).begin(), (v).end() #define pre(a) cout<<fixed; cout.precision(a) #define mp make_pair typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const int inf = 1e9; const ll INF = 1e18; ll n, m; string s[100010]; int k[100010]; int F[100010], M[100010]; int main() { fast; cin >> n; cin >> m; for(int i=1; i<=m; i++) { cin >> s[i] >> k[i]; } for(int i=0; i<s[1].size(); i++) { F[i+1] = F[i]; M[i+1] = M[i]; if(s[1][i] == 'F') F[i+1]++; else M[i+1]++; } if(F[n] < M[n]) { cout << -1; return 0; } int ans = 0; for(int i=0; i<s[1].size(); i++) { if(s[1][i] == 'F') ans = max(ans, (M[n] - M[i]) - (F[n] - F[i])); } cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |