# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537397 | 79brue | The Kingdom of JOIOI (JOI17_joioi) | C++14 | 822 ms | 16128 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;
typedef long long ll;
int n, m;
int arr[2002][2002];
int totalMin, totalMax;
int zero[2002][2], one[2002][2];
void flipArr(){
for(int i=1; i<=n; i++) if(i<n+1-i){
for(int j=0; j<2; j++){
swap(zero[i][j], zero[n+1-i][j]);
swap(one[i][j], one[n+1-i][j]);
}
}
// for(int i=1; i<=n; i++) for(int j=0; j<2; j++){
// if(1<=zero[i][j] && zero[i][j]<=m) zero[i][j] = m+1-zero[i][j];
// if(1<=one[i][j] && one[i][j] <= m) one[i][j] = m+1-one[i][j];
// }
}
void swapArr(){
for(int i=1; i<=n; i++) for(int j=0; j<2; j++) swap(zero[i][j], one[i][j]);
}
bool solve(){
/// 왼쪽은 0, 오른쪽은 1
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... |