Submission #496938

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
496938	2021-12-22T07:17:59 Z	mansur	Coin Collecting (JOI19_ho_t4)	C++17	8 / 100	548 ms	380 KB

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 = 1e18, 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;
	int x[n * 2 + 1], y[n * 2 + 1];
	for (int i = 0; i < n * 2; i++) {
		cin >> x[i] >> y[i];
	}
	int mn = inf;
	for (int mask = 1; mask < (1 << (n * 2)); mask++) {
		vector<pii> a, b;
		for (int i = 0; i < n * 2; i++) {
			if (mask >> i & 1) {
				a.pb({x[i], y[i]});
		 	}else b.pb({x[i], y[i]});
		}
		if (sz(a) != sz(b)) continue;
		sort(all(a));
		sort(all(b));
		int cur = 0;
		for (int i = 1; i <= n; i++) cur += abs(a[i - 1].ff - i) + abs(a[i - 1].ss - 1);
		for (int i = 1; i <= n; i++) cur += abs(b[i - 1].ff - i) + abs(b[i - 1].ss - 2);
		mn = min(mn, cur);
	}
	cout << mn;
}

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() {
      | ^~~~

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	280 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	426 ms	288 KB	Output is correct
5	Correct	421 ms	288 KB	Output is correct
6	Correct	497 ms	288 KB	Output is correct
7	Correct	446 ms	284 KB	Output is correct
8	Correct	434 ms	284 KB	Output is correct
9	Correct	460 ms	288 KB	Output is correct
10	Correct	457 ms	288 KB	Output is correct
11	Correct	433 ms	288 KB	Output is correct
12	Correct	456 ms	284 KB	Output is correct
13	Correct	422 ms	292 KB	Output is correct
14	Correct	476 ms	288 KB	Output is correct
15	Correct	433 ms	292 KB	Output is correct
16	Correct	447 ms	300 KB	Output is correct
17	Correct	500 ms	288 KB	Output is correct
18	Correct	436 ms	288 KB	Output is correct
19	Correct	480 ms	284 KB	Output is correct
20	Correct	436 ms	292 KB	Output is correct
21	Correct	445 ms	288 KB	Output is correct
22	Correct	443 ms	292 KB	Output is correct
23	Correct	453 ms	284 KB	Output is correct
24	Correct	451 ms	284 KB	Output is correct
25	Correct	444 ms	324 KB	Output is correct
26	Correct	478 ms	284 KB	Output is correct
27	Correct	425 ms	284 KB	Output is correct
28	Correct	486 ms	284 KB	Output is correct
29	Correct	438 ms	204 KB	Output is correct
30	Correct	454 ms	288 KB	Output is correct
31	Correct	485 ms	284 KB	Output is correct
32	Correct	448 ms	288 KB	Output is correct
33	Correct	440 ms	284 KB	Output is correct

Subtask #2
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	280 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	426 ms	288 KB	Output is correct
5	Correct	421 ms	288 KB	Output is correct
6	Correct	497 ms	288 KB	Output is correct
7	Correct	446 ms	284 KB	Output is correct
8	Correct	434 ms	284 KB	Output is correct
9	Correct	460 ms	288 KB	Output is correct
10	Correct	457 ms	288 KB	Output is correct
11	Correct	433 ms	288 KB	Output is correct
12	Correct	456 ms	284 KB	Output is correct
13	Correct	422 ms	292 KB	Output is correct
14	Correct	476 ms	288 KB	Output is correct
15	Correct	433 ms	292 KB	Output is correct
16	Correct	447 ms	300 KB	Output is correct
17	Correct	500 ms	288 KB	Output is correct
18	Correct	436 ms	288 KB	Output is correct
19	Correct	480 ms	284 KB	Output is correct
20	Correct	436 ms	292 KB	Output is correct
21	Correct	445 ms	288 KB	Output is correct
22	Correct	443 ms	292 KB	Output is correct
23	Correct	453 ms	284 KB	Output is correct
24	Correct	451 ms	284 KB	Output is correct
25	Correct	444 ms	324 KB	Output is correct
26	Correct	478 ms	284 KB	Output is correct
27	Correct	425 ms	284 KB	Output is correct
28	Correct	486 ms	284 KB	Output is correct
29	Correct	438 ms	204 KB	Output is correct
30	Correct	454 ms	288 KB	Output is correct
31	Correct	485 ms	284 KB	Output is correct
32	Correct	448 ms	288 KB	Output is correct
33	Correct	440 ms	284 KB	Output is correct
34	Incorrect	548 ms	380 KB	Output isn't correct
35	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	280 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	426 ms	288 KB	Output is correct
5	Correct	421 ms	288 KB	Output is correct
6	Correct	497 ms	288 KB	Output is correct
7	Correct	446 ms	284 KB	Output is correct
8	Correct	434 ms	284 KB	Output is correct
9	Correct	460 ms	288 KB	Output is correct
10	Correct	457 ms	288 KB	Output is correct
11	Correct	433 ms	288 KB	Output is correct
12	Correct	456 ms	284 KB	Output is correct
13	Correct	422 ms	292 KB	Output is correct
14	Correct	476 ms	288 KB	Output is correct
15	Correct	433 ms	292 KB	Output is correct
16	Correct	447 ms	300 KB	Output is correct
17	Correct	500 ms	288 KB	Output is correct
18	Correct	436 ms	288 KB	Output is correct
19	Correct	480 ms	284 KB	Output is correct
20	Correct	436 ms	292 KB	Output is correct
21	Correct	445 ms	288 KB	Output is correct
22	Correct	443 ms	292 KB	Output is correct
23	Correct	453 ms	284 KB	Output is correct
24	Correct	451 ms	284 KB	Output is correct
25	Correct	444 ms	324 KB	Output is correct
26	Correct	478 ms	284 KB	Output is correct
27	Correct	425 ms	284 KB	Output is correct
28	Correct	486 ms	284 KB	Output is correct
29	Correct	438 ms	204 KB	Output is correct
30	Correct	454 ms	288 KB	Output is correct
31	Correct	485 ms	284 KB	Output is correct
32	Correct	448 ms	288 KB	Output is correct
33	Correct	440 ms	284 KB	Output is correct
34	Incorrect	548 ms	380 KB	Output isn't correct
35	Halted	0 ms	0 KB	-

Submission #496938

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 0 / 29.0

Subtask #3 0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
0 / 29.0

Subtask #3
0 / 63.0