oj.uz

답안 #925472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925472 2024-02-11T18:13:08 Z jcelin Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 142 ms 16064 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<pll> vpll;

#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define all(x) (x).begin(), (x).end()

const int mod = 1e9 + 7; //998244353;
const int inf = 1e9 + 7;
const ll INF = 1e18 + 7;
const int logo = 20;
const int MAXN = 1e6 + 7;
const int off = 1 << logo;
const int trsz = off << 1;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

map<int, int> f;
int arr[MAXN];
vi st;

void solve(){
	int n;
	cin >> n;
	for(int i=1; i<=n; i++){
		int x;
		cin >> x;
		if(f[x] != 0){
			while(1){
				int u = st.back();
				st.PPB();
				f[arr[u]]--;
				if(arr[u] == x) break;
			}
		}
		st.PB(i);
		f[x] = 1;
		arr[i] = x;
	}
	

	
	int j = 0;
	for(int i=1; i<=n; i++){
		if(i > st[j]) j++;
		cout << arr[st[j]] << "\n";
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
	return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 20 ms 2960 KB Output is correct
18 Correct 20 ms 2908 KB Output is correct
19 Correct 21 ms 2908 KB Output is correct
20 Correct 20 ms 2908 KB Output is correct
21 Correct 21 ms 2908 KB Output is correct
22 Correct 21 ms 2908 KB Output is correct
23 Correct 21 ms 2904 KB Output is correct
24 Correct 21 ms 3032 KB Output is correct
25 Correct 21 ms 2908 KB Output is correct
26 Correct 20 ms 2908 KB Output is correct
27 Correct 21 ms 2904 KB Output is correct
28 Correct 21 ms 2908 KB Output is correct
29 Correct 20 ms 2908 KB Output is correct
30 Correct 20 ms 2944 KB Output is correct
31 Correct 20 ms 2908 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 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 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 20 ms 2960 KB Output is correct
48 Correct 20 ms 2908 KB Output is correct
49 Correct 21 ms 2908 KB Output is correct
50 Correct 20 ms 2908 KB Output is correct
51 Correct 21 ms 2908 KB Output is correct
52 Correct 21 ms 2908 KB Output is correct
53 Correct 21 ms 2904 KB Output is correct
54 Correct 21 ms 3032 KB Output is correct
55 Correct 21 ms 2908 KB Output is correct
56 Correct 20 ms 2908 KB Output is correct
57 Correct 21 ms 2904 KB Output is correct
58 Correct 21 ms 2908 KB Output is correct
59 Correct 20 ms 2908 KB Output is correct
60 Correct 20 ms 2944 KB Output is correct
61 Correct 20 ms 2908 KB Output is correct
62 Correct 29 ms 5720 KB Output is correct
63 Correct 135 ms 15568 KB Output is correct
64 Correct 138 ms 15436 KB Output is correct
65 Correct 34 ms 5704 KB Output is correct
66 Correct 30 ms 5460 KB Output is correct
67 Correct 32 ms 5904 KB Output is correct
68 Correct 35 ms 5980 KB Output is correct
69 Correct 32 ms 5792 KB Output is correct
70 Correct 37 ms 6124 KB Output is correct
71 Correct 32 ms 5716 KB Output is correct
72 Correct 31 ms 5712 KB Output is correct
73 Correct 102 ms 10840 KB Output is correct
74 Correct 113 ms 10964 KB Output is correct
75 Correct 106 ms 16024 KB Output is correct
76 Correct 142 ms 15924 KB Output is correct
77 Correct 110 ms 16064 KB Output is correct
78 Correct 105 ms 15932 KB Output is correct