oj.uz

답안 #494748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494748 2021-12-16T05:10:38 Z Haruto810198 Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 100010;

int n;
int px[MAX], py[MAX];
int tx[MAX], ty[MAX];
int res;

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	FOR(i, 1, 2*n, 1){
		cin>>px[i]>>py[i];
		tx[i] = (i + 1) / 2;
		ty[i] = (i > n) ? 2 : 1;
	}

	sort(px+1, px+2*n+1);
	sort(py+1, py+2*n+1);

	FOR(i, 1, 2*n, 1){
		res += abs(px[i] - tx[i]) + abs(py[i] - ty[i]);
	}
	
	cout<<res<<'\n';
	
	return 0;

}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Incorrect 0 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Incorrect 0 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Incorrect 0 ms 336 KB Output isn't correct
7 Halted 0 ms 0 KB -