답안 #891440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891440	2023-12-23T03:51:49 Z	abysmal	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	109 ms	14416 KB

Main

#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<string>
#include<math.h>
#include<assert.h>

using namespace std;

const double PI = (double) atan(1.0) * 4;
const int64_t INF = (int64_t) 1e18 + 777;
const int64_t mINF = (int64_t) 1e6 + 777;
const int64_t offset = (int64_t) 1e6 + 777;
const int64_t MOD = 1e9 + 7;
const int nbit = 11;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};
// 0 right // 1 down // 2 left // 3 up

int modadd(int t1, int t2)
{
    int res = t1 + t2;
    if(res >= MOD) res -= MOD;

    return res;
}

int modmul(int t1, int t2)
{
    int64_t res = 1LL * t1 * t2;
    return (res % MOD);
}

struct Range
{
    int l; int r;

    Range(int l_, int r_) : l(l_), r(r_) {}

    bool operator < (const Range& o) const
    {
        return l < o.l;
    }
};

struct Solution
{
    int n;
    Solution() {}

    void solve()
    {
        cin >> n;
        vector<int> a(n);
        for(int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        vector<Range> v;
        map<int, int> mp;
        for(int i = n - 1; i >= 0; i--)
        {
            if(mp.count(a[i])) v.emplace_back(i, mp[a[i]]);
            mp[a[i]] = i;
        }

        sort(v.begin(), v.end());
        int c = -1;
        int cur = -1;
        int id = 0;
        for(int i = 0; i < n; i++)
        {
            while(id < (int) v.size() && v[id].l < cur)
            {
                id++;
            }

            if(id < (int) v.size() && i == v[id].l)
            {
                c = a[i];
                cur = v[id].r;
            }

            if(cur < i) cout << a[i] << "\n";
            else cout << c << "\n";
        }
    }

    int modsub(int t1, int t2)
    {
        int res = t1 - t2;
        if(res < 0) res += MOD;

        return res;
    }

    bool BIT(int& mask, int& j)
    {
        return (mask & MASK(j));
    }

    int64_t Abs(int64_t t1)
    {
        if(t1 < 0) return -t1;
        return t1;
    }

    int MASK(int j)
    {
        return (1 << j);
    }
};

void __startup()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
}

int main()
{
    __startup();
    int t = 1;
//    cin >> t;

    for(int i = 1; i <= t; i++)
    {
        Solution().solve();
    }

    return 0;
}

Subtask #1
25.0 / 25.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	356 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 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	344 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	452 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 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	344 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	348 KB	Output is correct
29	Correct	1 ms	348 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	452 KB	Output is correct
2	Correct	0 ms	424 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	22 ms	3644 KB	Output is correct
18	Correct	21 ms	3784 KB	Output is correct
19	Correct	24 ms	3796 KB	Output is correct
20	Correct	23 ms	3800 KB	Output is correct
21	Correct	23 ms	3800 KB	Output is correct
22	Correct	24 ms	4000 KB	Output is correct
23	Correct	24 ms	3800 KB	Output is correct
24	Correct	24 ms	3800 KB	Output is correct
25	Correct	24 ms	3800 KB	Output is correct
26	Correct	24 ms	3800 KB	Output is correct
27	Correct	23 ms	3800 KB	Output is correct
28	Correct	24 ms	3796 KB	Output is correct
29	Correct	22 ms	3796 KB	Output is correct
30	Correct	21 ms	3796 KB	Output is correct
31	Correct	21 ms	3800 KB	Output is correct

Subtask #3
40.0 / 40.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	356 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 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	344 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	452 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 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	344 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	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	452 KB	Output is correct
32	Correct	0 ms	424 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	1 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	22 ms	3644 KB	Output is correct
48	Correct	21 ms	3784 KB	Output is correct
49	Correct	24 ms	3796 KB	Output is correct
50	Correct	23 ms	3800 KB	Output is correct
51	Correct	23 ms	3800 KB	Output is correct
52	Correct	24 ms	4000 KB	Output is correct
53	Correct	24 ms	3800 KB	Output is correct
54	Correct	24 ms	3800 KB	Output is correct
55	Correct	24 ms	3800 KB	Output is correct
56	Correct	24 ms	3800 KB	Output is correct
57	Correct	23 ms	3800 KB	Output is correct
58	Correct	24 ms	3796 KB	Output is correct
59	Correct	22 ms	3796 KB	Output is correct
60	Correct	21 ms	3796 KB	Output is correct
61	Correct	21 ms	3800 KB	Output is correct
62	Correct	31 ms	6848 KB	Output is correct
63	Correct	109 ms	14388 KB	Output is correct
64	Correct	99 ms	14416 KB	Output is correct
65	Correct	34 ms	6496 KB	Output is correct
66	Correct	33 ms	6484 KB	Output is correct
67	Correct	34 ms	6864 KB	Output is correct
68	Correct	33 ms	6860 KB	Output is correct
69	Correct	34 ms	6860 KB	Output is correct
70	Correct	34 ms	6748 KB	Output is correct
71	Correct	35 ms	6856 KB	Output is correct
72	Correct	35 ms	6824 KB	Output is correct
73	Correct	90 ms	10444 KB	Output is correct
74	Correct	92 ms	10548 KB	Output is correct
75	Correct	100 ms	14416 KB	Output is correct
76	Correct	100 ms	14368 KB	Output is correct
77	Correct	98 ms	14400 KB	Output is correct
78	Correct	97 ms	14300 KB	Output is correct

답안 #891440

Compilation message

Subtask #1 25.0 / 25.0

Subtask #2 35.0 / 35.0

Subtask #3 40.0 / 40.0

Subtask #1
25.0 / 25.0

Subtask #2
35.0 / 35.0

Subtask #3
40.0 / 40.0