# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849293 | mickey080929 | Toilets (JOI16_toilets) | C++17 | 19 ms | 8648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
ll N, M;
vector<pair<string,ll>> v;
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
ll male = 0;
for (ll i=0; i<M; i++) {
string s;
ll rep;
cin >> s >> rep;
male += count(s.begin(), s.end(), 'M') * rep;
reverse(s.begin(), s.end());
v.emplace_back(s, rep);
}
if (male > N) {
cout << "-1";
return 0;
}
reverse(v.begin(), v.end());
M = (ll) v.size();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |