# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104329 | ihdignite | Coin Collecting (JOI19_ho_t4) | C++14 | 166 ms | 157052 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;
#define ll long long
const int mxN=1e5;
int n;
ll a1, dp[2*mxN+1][100];
array<int, 3> a[2*mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=0; i<2*n; ++i) {
cin >> a[i][0] >> a[i][2];
a[i][1]=rand();
if(a[i][0]<1) {
a1+=1-a[i][0];
a[i][0]=1;
} else if(a[i][0]>n) {
a1+=a[i][0]-n;
a[i][0]=n;
}
if(a[i][2]<1) {
a1+=1-a[i][2];
a[i][2]=1;
} else if(a[i][2]>2) {
a1+=a[i][2]-2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |