# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070381 | vjudge1 | Building 4 (JOI20_building4) | C++11 | 2 ms | 604 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;
using ll = long long;
int main() {
ll n; cin >> n;
ll ar[2*n], br[2*n];
string s;
for (ll i=0;i<2*n;i++) {
cin >> ar[i];
s+=".";
}
bool bisat[2*n];
memset(bisat, true, sizeof(bisat));
bool gagal = false;
vector<ll>dt;
vector<ll> lawan;
ll na=0, nb=0, mn=0;
for (ll i=0;i<2*n;i++) {
cin >> br[i];
bool ada = false;
if (ar[i]<=br[i]) {
if (ar[i]>=mn) {
s[i]='A';
na++;
dt.push_back(ar[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |