oj.uz

Submission #497071

# Submission time Handle Problem Language Result Execution time Memory
497071 2021-12-22T10:09:29 Z vinnipuh01 Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 312 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
 
using namespace std;
 
const long long oo = 1000000000000000000;
 
long long  sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
 
 
/*
    ViHHiPuh
 
   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
 
 
    cout << fixed << setprecision(6) << x;
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    freopen ( "sum.in", "r", stdin )
*/
 
int bl[ 1000001 ][ 3 ];
queue <pair<int, int> > q, qq;
 
int d( int x, int y, int xx, int yy ) {
	return abs( x - xx ) + abs( y - yy );
}
 
main () {
	int n;
	cin >> n;
	pair<int, int> a[ n + n + 1 ];
	int y, x;
	int x1, y1, x2, y2, x3, y3, x4, y4;
	x1 = y1 = 1;
	x2 = 1, y2 = 2;
	x3 = n, y3 = 1;
	x4 = n, y4 = 2;
	for ( int i = 1; i <= n + n; i ++ ) {
		cin >> a[ i ].first >> a[ i ].second;
		if ( a[ i ].second <= 1 ) {
			y = 1;
			if ( a[ i ].first >= 1 && a[ i ].first <= n )
				x = a[ i ].first;
			else {
				if ( a[ i ].first < 1 )
					x = 1;
				else	
					x = n;
			}
		}
		else {
			y = 2;
			if ( a[ i ].first >= 1 && a[ i ].first <= n )
				x = a[ i ].first;
			else {
				if ( a[ i ].first < 1 )
					x = 1;
				else	
					x = n;
			}
		}
		ans += d( x, y, a[ i ].first, a[ i ].second );
		bl[ x ][ y ] ++;
	}
	mn = 0;
	for ( int i = 1; i <= n; i ++ ) {
		bl[ i ][ 1 ] --;
		if ( bl[ i ][ 1 ] > 0 ) {
			sum += bl[ i ][ 1 ];
		}
		else if ( bl[ i ][ 1 ] < 0 ) {
			mx ++;
		}
		bl[ i ][ 2 ] --;
		if ( bl[ i ][ 2 ] > 0 )
			num += bl[ i ][ 2 ];
		else if ( bl[ i ][  2] < 0 )
			mn ++;
		if ( mn && num ) {
			if ( mn < num ) {
				num -= mn;
				mn = 0;
			}
			else
				mn -= num, num = 0;
		}
		if ( mn && sum ) {
			ans += min( mn, sum );
			if ( mn < sum )
				sum -= mn, mn = 0;
			else
				mn -= sum, sum = 0;
		}
		if ( mx && sum ) {
			if ( mx < sum )
				sum -= mx, mx = 0;
			else
				mx -= sum, sum = 0;
		}
		if ( mx && num ) {
			ans += min( mx, num );
			if ( mx < num )
				num -= mx, mx = 0;
			else
				mx -= num, num = 0;
		}
		ans += num + sum + mx + mn;
	}
	cout << ans;
}

Compilation message

joi2019_ho_t4.cpp:53:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   53 | main () {
      | ^~~~
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:58:6: warning: variable 'x1' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |      ^~
joi2019_ho_t4.cpp:58:14: warning: variable 'x2' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |              ^~
joi2019_ho_t4.cpp:58:18: warning: variable 'y2' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |                  ^~
joi2019_ho_t4.cpp:58:22: warning: variable 'x3' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |                      ^~
joi2019_ho_t4.cpp:58:26: warning: variable 'y3' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |                          ^~
joi2019_ho_t4.cpp:58:30: warning: variable 'x4' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |                              ^~
joi2019_ho_t4.cpp:58:34: warning: variable 'y4' set but not used [-Wunused-but-set-variable]
   58 |  int x1, y1, x2, y2, x3, y3, x4, y4;
      |                                  ^~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Incorrect 0 ms 204 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Incorrect 0 ms 204 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Incorrect 0 ms 204 KB Output isn't correct
19 Halted 0 ms 0 KB -