oj.uz

Submission #826969

# Submission time Handle Problem Language Result Execution time Memory
826969 2023-08-16T07:36:28 Z LeVanThuc Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 166 ms 19892 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define p(x,y) pair<ll,ll>(x,y)
#define BIT(i,x) ((x>>i)&1)
#define MASK(x) (1<<x)
#define ld long double
#define __builtin_popcount __builtin_popcountll
#define pll pair<ll,ll>
template<class T1,class T2>
bool maximize(T1 &x,const T2 &y)
{
    if(x<y)
    {
        x=y;
        return 1;
    }
    return 0;
}
template<class T1,class T2>
bool minimize(T1 &x,const T2 &y)
{
    if(x>y)
    {
        x=y;
        return 1;
    }
    return 0;
}
void online()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
}
ll n;
int main()
{
    online();
    cin>>n;
    set<pll> S;
    vector<pll> vt;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        if(vt.empty())
        {
            vt.emplace_back(x,i);
            S.emplace(x,i);
            continue;
        }
        bool flag=1;
        auto z=S.lower_bound(p(x,i));
        if(z!=S.begin())
        {
            z--;
            
            if((*z).fi==x)
            {
            ll y=(*z).se;
            while(vt.back().se>y)
            {
                S.erase(vt.back());
                vt.pop_back();
            }
            flag=0;
            }
        }
        if(flag)
        {
            S.emplace(x,i);
            vt.emplace_back(x,i);
        }
    }
    ll j=0,vl=0;
    for(int i=1;i<=n;i++)
    {
        if(j<vt.size()&&vt[j].se==i) 
        {
            vl=vt[j].fi;
            j++;
        }
        cout<<vl<<'\n';
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:80:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         if(j<vt.size()&&vt[j].se==i)
      |            ~^~~~~~~~~~

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 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 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 252 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 332 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 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 408 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 19 ms 1028 KB Output is correct
18 Correct 21 ms 1008 KB Output is correct
19 Correct 22 ms 1024 KB Output is correct
20 Correct 23 ms 1076 KB Output is correct
21 Correct 22 ms 1092 KB Output is correct
22 Correct 22 ms 1104 KB Output is correct
23 Correct 22 ms 996 KB Output is correct
24 Correct 25 ms 1100 KB Output is correct
25 Correct 27 ms 976 KB Output is correct
26 Correct 22 ms 1100 KB Output is correct
27 Correct 22 ms 1096 KB Output is correct
28 Correct 22 ms 1012 KB Output is correct
29 Correct 23 ms 1076 KB Output is correct
30 Correct 23 ms 1056 KB Output is correct
31 Correct 19 ms 1096 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 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 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 252 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 332 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 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 408 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 320 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 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 212 KB Output is correct
40 Correct 1 ms 316 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 324 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 324 KB Output is correct
47 Correct 19 ms 1028 KB Output is correct
48 Correct 21 ms 1008 KB Output is correct
49 Correct 22 ms 1024 KB Output is correct
50 Correct 23 ms 1076 KB Output is correct
51 Correct 22 ms 1092 KB Output is correct
52 Correct 22 ms 1104 KB Output is correct
53 Correct 22 ms 996 KB Output is correct
54 Correct 25 ms 1100 KB Output is correct
55 Correct 27 ms 976 KB Output is correct
56 Correct 22 ms 1100 KB Output is correct
57 Correct 22 ms 1096 KB Output is correct
58 Correct 22 ms 1012 KB Output is correct
59 Correct 23 ms 1076 KB Output is correct
60 Correct 23 ms 1056 KB Output is correct
61 Correct 19 ms 1096 KB Output is correct
62 Correct 28 ms 4268 KB Output is correct
63 Correct 116 ms 10260 KB Output is correct
64 Correct 120 ms 8672 KB Output is correct
65 Correct 34 ms 3960 KB Output is correct
66 Correct 30 ms 3816 KB Output is correct
67 Correct 32 ms 4188 KB Output is correct
68 Correct 32 ms 4164 KB Output is correct
69 Correct 34 ms 4256 KB Output is correct
70 Correct 34 ms 4192 KB Output is correct
71 Correct 34 ms 4252 KB Output is correct
72 Correct 36 ms 4156 KB Output is correct
73 Correct 124 ms 11952 KB Output is correct
74 Correct 91 ms 12040 KB Output is correct
75 Correct 124 ms 19892 KB Output is correct
76 Correct 166 ms 19832 KB Output is correct
77 Correct 120 ms 19784 KB Output is correct
78 Correct 119 ms 19856 KB Output is correct