oj.uz

Submission #774636

# Submission time Handle Problem Language Result Execution time Memory
774636 2023-07-06T01:05:23 Z tpd2k Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 420 ms 33624 KB 
// teddybear's code
// the one who loves NBP
// noe the second
// goal: 0 / 8
// get medal in APIO (like TKN)
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

// prob: 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

#define FOR(i,n) for (int i = 0; i<n; i++)
using ll = long long;
using ull = unsigned long long;
ll n,m,t;
ll cnt = 0;
const int maxn = 1e5;
const ll mod = 1e9 + 7;
#define Y "YES"
#define N "NO"
ll a[2 * maxn + 5];
bool visited[1005][1005];
int dist[1005][1005];
int w,h;
int fx[4] = {-1, 1, 0, 0};
int fy[4] = {0, 0, -1, 1};
queue <pair<int,int>> q;

ll b[2 * maxn + 5];

void solve()
{
	map <int,int> mp;
	map <int,int> fir, las;
	cin >> n;
	for (int i = 1; i<=n; i++)
	{
		cin >> a[i];
		mp[a[i]]++;
		fir[a[i]] = 1e9;
		fir[a[i]] = min(i, fir[a[i]]);
		las[a[i]] = max(i, las[a[i]]);
	}	
	/*for (int i = 1; i<=n; i++)
	{
		cout << b[i] << '\n';
	}*/
	
	int tmp = 1;
	while (tmp <= n)
	{
		if (mp[a[tmp]] == 1)
		{
			b[tmp] = a[tmp];
			mp[a[tmp]]--;
			tmp++;
			continue;
		}
		else
		{
			ll en = las[a[tmp]];
			ll z = a[tmp];
			b[tmp] = a[tmp];
			mp[a[tmp]]--;
			tmp++;
			while (tmp <= en)
			{
				mp[a[tmp]]--;
				b[tmp] = z;
				tmp++;
			}
		}
	}
	
	for (int i = 1; i<=n; i++)
	{
		cout << b[i] << '\n';
	}
	
}

void init()
{
 	int te = 1; //cin >> te;
 	while (te--)
 	{
 	 	  solve();
 	}
}

void preprocess()
{

}


int main()
{
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL);
    //cin.tie(0); cout.tie(0);
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
 	init();
 	preprocess();
 	//solve();
 	return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 19 ms 3796 KB Output is correct
18 Correct 19 ms 3796 KB Output is correct
19 Correct 24 ms 3796 KB Output is correct
20 Correct 23 ms 3756 KB Output is correct
21 Correct 23 ms 3780 KB Output is correct
22 Correct 24 ms 3796 KB Output is correct
23 Correct 23 ms 3836 KB Output is correct
24 Correct 24 ms 3768 KB Output is correct
25 Correct 23 ms 3796 KB Output is correct
26 Correct 22 ms 3808 KB Output is correct
27 Correct 23 ms 3832 KB Output is correct
28 Correct 23 ms 3832 KB Output is correct
29 Correct 20 ms 3792 KB Output is correct
30 Correct 22 ms 3760 KB Output is correct
31 Correct 19 ms 3776 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 19 ms 3796 KB Output is correct
48 Correct 19 ms 3796 KB Output is correct
49 Correct 24 ms 3796 KB Output is correct
50 Correct 23 ms 3756 KB Output is correct
51 Correct 23 ms 3780 KB Output is correct
52 Correct 24 ms 3796 KB Output is correct
53 Correct 23 ms 3836 KB Output is correct
54 Correct 24 ms 3768 KB Output is correct
55 Correct 23 ms 3796 KB Output is correct
56 Correct 22 ms 3808 KB Output is correct
57 Correct 23 ms 3832 KB Output is correct
58 Correct 23 ms 3832 KB Output is correct
59 Correct 20 ms 3792 KB Output is correct
60 Correct 22 ms 3760 KB Output is correct
61 Correct 19 ms 3776 KB Output is correct
62 Correct 29 ms 5340 KB Output is correct
63 Correct 400 ms 33624 KB Output is correct
64 Correct 378 ms 33612 KB Output is correct
65 Correct 32 ms 5176 KB Output is correct
66 Correct 37 ms 5144 KB Output is correct
67 Correct 34 ms 5420 KB Output is correct
68 Correct 34 ms 5452 KB Output is correct
69 Correct 37 ms 5436 KB Output is correct
70 Correct 35 ms 5404 KB Output is correct
71 Correct 35 ms 5388 KB Output is correct
72 Correct 34 ms 5404 KB Output is correct
73 Correct 251 ms 19388 KB Output is correct
74 Correct 265 ms 19420 KB Output is correct
75 Correct 403 ms 33568 KB Output is correct
76 Correct 402 ms 33596 KB Output is correct
77 Correct 400 ms 33612 KB Output is correct
78 Correct 420 ms 33484 KB Output is correct