Submission #496966

#	Time	Username	Problem	Language	Result	Execution time	Memory
496966		mansur	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	0 ms	332 KiB

joi2019_ho_t4

#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}};
 
int dp[1001][2001][3];

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;
		a.pb({x, y});
	}
	sort(all(a));
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= sz(a); j++) {
			for (int t = 0; t <= 2; t++) dp[i][j][t] = inf;
		}
	}
	dp[0][0][0] = dp[0][0][1] = dp[0][0][2] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= sz(a); j++) {
			for (int t = 2; t >= 0; t--) {
				dp[i][j][t] = dp[i][j - 1][t];
				if (t == 0) {
					dp[i][j][t] = min(dp[i][j][t], dp[i][j - 1][2] + abs(a[j - 1].ff - i) + abs(a[j - 1].ss - 1));
					dp[i][j][t] = min(dp[i][j][t], dp[i][j - 1][1] + abs(a[j - 1].ff - i) + abs(a[j - 1].ss - 2));
				}else {
					dp[i][j][t] = min(dp[i][j][t], dp[i - 1][j - 1][0] + abs(a[j - 1].ff - i) + abs(a[j - 1].ss - t));
				}
			}
		}
   	}
   	cout << dp[n][sz(a)][0];
} 

Compilation message (stderr)

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:37:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   37 | main() {
      | ^~~~
joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:51: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]
   51 |   for (int j = 0; j <= sz(a); j++) {
      |                     ^
joi2019_ho_t4.cpp:57: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]
   57 |   for (int j = 1; j <= sz(a); j++) {
      |                     ^

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63