# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091501 | quangminh412 | Stove (JOI18_stove) | C++14 | 0 ms | 344 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>
using namespace std;
/*
John Watson
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 5e5 + 9;
int n, m;
int t[maxn], a[maxn];
bool solve(int k)
{
int pre = k;
unordered_map<int, int> mp;
int i = 1;
while (i <= m)
{
if (mp[a[i]] == t[i]) pre--;
mp[a[i]] = 1;
i++;
if (pre == 0) break;
}
if (i == m + 1) return true;
set<int> se;
for (auto it : mp) if (it.second != 0) se.insert(it.first);
for (int j = i; j <= m; j++)
{
auto it1 = lower_bound(se.begin(), se.end(), a[j]);
auto it2 = it1; it2--;
}
}
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> n >> m;
vector<pair<int, int>> v(m);
for (int i = 0; i < m; i++) cin >> v[i].first;
for (int i = 0; i < m; i++) cin >> v[i].second;
sort(v.begin(), v.end());
for (int i = 1; i <= m; i++)
{
t[i] = v[i - 1].first;
a[i] = v[i - 1].second;
}
return 0;
}
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... |