답안 #736956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736956 2023-05-06T11:40:56 Z nguyentunglam Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
200 ms 14996 KB
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
int l[N], r[N], c[N];
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int n; cin >> n;
    int p = 0;
    map<int, int> cnt;
    for(int i = 1; i <= n; i++) {
        int x; cin >> x;
        if (cnt[x]) {
            while (c[p] != x) cnt[c[p]]--, p--;
            r[p] = i;
        }
        else {
            ++p;
            l[p] = r[p] = i;
            c[p] = x;
            cnt[x]++;
        }
    }
    for(int i = 1; i <= p; i++) for(int j = l[i]; j <= r[i]; j++) cout << c[i] << endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:14:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:17:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:18:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 1 ms 296 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 332 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 336 KB Output is correct
25 Correct 1 ms 336 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 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 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 1 ms 340 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 22 ms 608 KB Output is correct
18 Correct 21 ms 728 KB Output is correct
19 Correct 23 ms 668 KB Output is correct
20 Correct 23 ms 712 KB Output is correct
21 Correct 23 ms 736 KB Output is correct
22 Correct 23 ms 712 KB Output is correct
23 Correct 23 ms 752 KB Output is correct
24 Correct 26 ms 724 KB Output is correct
25 Correct 24 ms 724 KB Output is correct
26 Correct 23 ms 668 KB Output is correct
27 Correct 23 ms 644 KB Output is correct
28 Correct 23 ms 732 KB Output is correct
29 Correct 24 ms 724 KB Output is correct
30 Correct 24 ms 716 KB Output is correct
31 Correct 24 ms 720 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 1 ms 296 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 332 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 336 KB Output is correct
25 Correct 1 ms 336 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 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 340 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 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 22 ms 608 KB Output is correct
48 Correct 21 ms 728 KB Output is correct
49 Correct 23 ms 668 KB Output is correct
50 Correct 23 ms 712 KB Output is correct
51 Correct 23 ms 736 KB Output is correct
52 Correct 23 ms 712 KB Output is correct
53 Correct 23 ms 752 KB Output is correct
54 Correct 26 ms 724 KB Output is correct
55 Correct 24 ms 724 KB Output is correct
56 Correct 23 ms 668 KB Output is correct
57 Correct 23 ms 644 KB Output is correct
58 Correct 23 ms 732 KB Output is correct
59 Correct 24 ms 724 KB Output is correct
60 Correct 24 ms 716 KB Output is correct
61 Correct 24 ms 720 KB Output is correct
62 Correct 35 ms 2272 KB Output is correct
63 Correct 174 ms 12724 KB Output is correct
64 Correct 163 ms 12272 KB Output is correct
65 Correct 38 ms 2120 KB Output is correct
66 Correct 34 ms 2144 KB Output is correct
67 Correct 39 ms 3452 KB Output is correct
68 Correct 45 ms 2244 KB Output is correct
69 Correct 42 ms 2284 KB Output is correct
70 Correct 39 ms 2992 KB Output is correct
71 Correct 38 ms 2380 KB Output is correct
72 Correct 41 ms 2512 KB Output is correct
73 Correct 140 ms 9256 KB Output is correct
74 Correct 112 ms 9276 KB Output is correct
75 Correct 144 ms 14828 KB Output is correct
76 Correct 200 ms 14380 KB Output is correct
77 Correct 142 ms 14996 KB Output is correct
78 Correct 148 ms 14052 KB Output is correct