# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869632 | irmuun | Ancient Machine 2 (JOI23_ancient2) | C++17 | 68 ms | 692 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>
#include "ancient2.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
string Solve(int n){
vector<int>a={1,1,2},b={2,1,2};
vector<int>A,B;
for(int i=0;i<950;i++){
if(i<511/2){
A.pb(i*2+1);
B.pb(i*2+2);
}
else if(i<511){
A.pb(i);
B.pb(i);
}
else{
A.pb(i+1);
B.pb(i+1);
}
}
A.pb(950);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |