답안 #889857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889857	2023-12-20T08:25:24 Z	vjudge1	Coin Collecting (JOI19_ho_t4)	C++17	37 / 100	14 ms	17756 KB

joi2019_ho_t4

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+10;
const long long inf = 2e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

struct point {
	int x, y;
} a[2005];

ll distance(point a, point b) {
	return (ll)abs(a.x - b.x) + abs(a.y - b.y);
}

bool comp(point a, point b) {
	if(a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}

ll dp[2005][2005];

void Baizho() {	
	int n; cin>>n;
	ll ans = 0;
	for(int i = 1; i <= n + n; i ++) {
		cin>>a[i].x>>a[i].y;
	}
	sort(a + 1, a + n + n + 1, comp);
	for(int i = 0; i <= n; i ++) for(int j = 0; j <= n; j ++) dp[i][j] = inf;
	dp[0][0] = 0;
	for(int i = 1; i <= n + n; i ++) {
		for(int x = 0; x <= min(i, n); x ++) {
			int y = i - x;
			if(x) dp[x][y] = min(dp[x][y], dp[x-1][y] + abs(a[i].x - x) + abs(a[i].y - 1));
			if(y) dp[x][y] = min(dp[x][y], dp[x][y - 1] + abs(a[i].x - y) + abs(a[i].y - 2));
		}
	}
//	for(int i = 0; i <= n; i ++) {
//		for(int j = 0; j <= n; j ++) cout<<dp[i][j]<<" ";
//		cout<<"\n";
//	}
	cout<<dp[n][n];
	
}
 
signed main() {		
 
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho(); }
}

Compilation message

joi2019_ho_t4.cpp: In function 'void Baizho()':
joi2019_ho_t4.cpp:54:5: warning: unused variable 'ans' [-Wunused-variable]
   54 |  ll ans = 0;
      |     ^~~
joi2019_ho_t4.cpp: In function 'void Freopen(std::string)':
joi2019_ho_t4.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	9 ms	16988 KB	Output is correct
35	Correct	9 ms	16988 KB	Output is correct
36	Correct	10 ms	16984 KB	Output is correct
37	Correct	10 ms	16984 KB	Output is correct
38	Correct	9 ms	16988 KB	Output is correct
39	Correct	10 ms	17104 KB	Output is correct
40	Correct	14 ms	17756 KB	Output is correct
41	Correct	10 ms	16988 KB	Output is correct
42	Correct	11 ms	16988 KB	Output is correct
43	Correct	10 ms	17060 KB	Output is correct
44	Correct	9 ms	16988 KB	Output is correct
45	Correct	9 ms	16988 KB	Output is correct
46	Correct	11 ms	17188 KB	Output is correct
47	Correct	10 ms	17104 KB	Output is correct
48	Correct	10 ms	17056 KB	Output is correct
49	Correct	9 ms	16988 KB	Output is correct
50	Correct	10 ms	16988 KB	Output is correct
51	Correct	10 ms	16988 KB	Output is correct
52	Correct	9 ms	16988 KB	Output is correct
53	Correct	9 ms	16864 KB	Output is correct
54	Correct	9 ms	16860 KB	Output is correct
55	Correct	9 ms	16988 KB	Output is correct
56	Correct	10 ms	17024 KB	Output is correct
57	Correct	10 ms	16988 KB	Output is correct
58	Correct	9 ms	16988 KB	Output is correct
59	Correct	10 ms	17108 KB	Output is correct
60	Correct	9 ms	16988 KB	Output is correct
61	Correct	10 ms	17080 KB	Output is correct
62	Correct	10 ms	17060 KB	Output is correct
63	Correct	10 ms	16988 KB	Output is correct
64	Correct	10 ms	16988 KB	Output is correct

Subtask #3
0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	9 ms	16988 KB	Output is correct
35	Correct	9 ms	16988 KB	Output is correct
36	Correct	10 ms	16984 KB	Output is correct
37	Correct	10 ms	16984 KB	Output is correct
38	Correct	9 ms	16988 KB	Output is correct
39	Correct	10 ms	17104 KB	Output is correct
40	Correct	14 ms	17756 KB	Output is correct
41	Correct	10 ms	16988 KB	Output is correct
42	Correct	11 ms	16988 KB	Output is correct
43	Correct	10 ms	17060 KB	Output is correct
44	Correct	9 ms	16988 KB	Output is correct
45	Correct	9 ms	16988 KB	Output is correct
46	Correct	11 ms	17188 KB	Output is correct
47	Correct	10 ms	17104 KB	Output is correct
48	Correct	10 ms	17056 KB	Output is correct
49	Correct	9 ms	16988 KB	Output is correct
50	Correct	10 ms	16988 KB	Output is correct
51	Correct	10 ms	16988 KB	Output is correct
52	Correct	9 ms	16988 KB	Output is correct
53	Correct	9 ms	16864 KB	Output is correct
54	Correct	9 ms	16860 KB	Output is correct
55	Correct	9 ms	16988 KB	Output is correct
56	Correct	10 ms	17024 KB	Output is correct
57	Correct	10 ms	16988 KB	Output is correct
58	Correct	9 ms	16988 KB	Output is correct
59	Correct	10 ms	17108 KB	Output is correct
60	Correct	9 ms	16988 KB	Output is correct
61	Correct	10 ms	17080 KB	Output is correct
62	Correct	10 ms	17060 KB	Output is correct
63	Correct	10 ms	16988 KB	Output is correct
64	Correct	10 ms	16988 KB	Output is correct
65	Runtime error	1 ms	604 KB	Execution killed with signal 11
66	Halted	0 ms	0 KB	-

답안 #889857

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
0 / 63.0