oj.uz

답안 #496782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496782 2021-12-22T04:30:06 Z mansur Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 312 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n;
	cin >> n;
	vector<pii> a, b;
	for (int i = 1, x, y; i <= n * 2; i++) {
		cin >> x >> y;
		if (y <= 1) {
			a.pb({x, y});
		}else b.pb({x, y});
	}
	sort(all(a));
	sort(all(b));
	if (sz(a) > sz(b)) {
		int j = 0, i = 1, ans = 0;
		for (; j < sz(a); j++) {
			if (i > n) break;
			ans += 1 - a[j].ss + abs(i - a[j].ff);
			i++;
		}
		int k = 1;
		for (int s = 0; s < sz(b); s++) {
			ans += b[s].ss - 2 + abs(k - b[s].ff);
			k++; 
		}
		for (; j < sz(a); j++) {
			ans += 2 - a[j].ss + abs(k - a[j].ff);
			k++;
		}
		cout << ans;
	}else {
    	int j = 0, i = 1, ans = 0;
		for (; j < sz(b); j++) {
			if (i > n) break;
			ans += b[j].ss - 2 + abs(i - b[j].ff);
			i++;
		}
		int k = 1;
		for (int s = 0; s < sz(a); s++) {
			ans += 1 - a[s].ss + abs(k - a[s].ff);
			k++; 
		}
		for (; j < sz(b); j++) {
			ans += a[j].ss - 1 + abs(k - b[j].ff);
			k++;
		}
		cout << ans;
    }
}

Compilation message

joi2019_ho_t4.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
joi2019_ho_t4.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
joi2019_ho_t4.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:53:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for (; j < sz(a); j++) {
      |            ^
joi2019_ho_t4.cpp:59:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int s = 0; s < sz(b); s++) {
      |                     ^
joi2019_ho_t4.cpp:63:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (; j < sz(a); j++) {
      |            ^
joi2019_ho_t4.cpp:70:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for (; j < sz(b); j++) {
      |            ^
joi2019_ho_t4.cpp:76:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for (int s = 0; s < sz(a); s++) {
      |                     ^
joi2019_ho_t4.cpp:80:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |   for (; j < sz(b); j++) {
      |            ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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