oj.uz

Submission #770222

# Submission time Handle Problem Language Result Execution time Memory
770222 2023-07-01T02:12:29 Z script_kidd Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 73 ms 19136 KB 
#include<bits/stdc++.h>
//#define int long long
using namespace std;
using pii=pair<int, int>;
using vi=vector<int>;
using vvi=vector<vector<int>>;

//using ll=long long;

#define loop(x,n) for(int x=0; x<n; x++)
#define loop1(x,n) for(int x=1; x<=n; x++)
#define loopr(x,n) for(int x=n; x-->0;)

#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define mp make_pair
#define all(v) begin(v), end(v)
#define UNTIE_IO ios_base::sync_with_stdio(0);cin.tie(0);

const int MAX=2e5+5;
const int INF=2e9;
const int MOD=998244353;

int N;
pii _c[MAX];
int c[MAX];
int m[MAX];
vector<int> p[MAX];


void solve(){
    vector<int> v;
    int lt;
    loop1(i, N){
        if (p[c[i]].size()){
            lt = p[c[i]].back();
            while (v.size()&&c[v.back()]!=c[i]){
                p[c[v.back()]].pop_back();
                v.pop_back();
            }
        }
        p[c[i]].pb(i);
        v.pb(i);
    }
    int idx=0;
    loop1(i, N){
        if (i>v[idx]) idx++;
        cout << m[c[v[idx]]] << '\n';
    }
}

signed main(){
    UNTIE_IO;
    cin>>N;

    int x;
    loop1(i, N){
        cin>>x;
        _c[i] = mp(x, i);
    }
    sort(_c+1, _c+1+N);

    int lt=-1, idx=0;
    loop1(i, N){
        if (lt!=_c[i].first){
            idx++;
            lt = _c[i].first;
            m[idx] = lt;
        }
        c[_c[i].second] = idx;
    }

    solve();

}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:35:9: warning: variable 'lt' set but not used [-Wunused-but-set-variable]
   35 |     int lt;
      |         ^~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5032 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 2 ms 5076 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5036 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5076 KB Output is correct
24 Correct 3 ms 5036 KB Output is correct
25 Correct 4 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 4 ms 5160 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5028 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5084 KB Output is correct
6 Correct 2 ms 4996 KB Output is correct
7 Correct 3 ms 5036 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5028 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 25 ms 9860 KB Output is correct
18 Correct 25 ms 9892 KB Output is correct
19 Correct 38 ms 8984 KB Output is correct
20 Correct 36 ms 9048 KB Output is correct
21 Correct 37 ms 8976 KB Output is correct
22 Correct 37 ms 9152 KB Output is correct
23 Correct 36 ms 9044 KB Output is correct
24 Correct 36 ms 9136 KB Output is correct
25 Correct 39 ms 9092 KB Output is correct
26 Correct 35 ms 8968 KB Output is correct
27 Correct 36 ms 8940 KB Output is correct
28 Correct 35 ms 8960 KB Output is correct
29 Correct 32 ms 9152 KB Output is correct
30 Correct 25 ms 9692 KB Output is correct
31 Correct 24 ms 9868 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5032 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 2 ms 5076 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5036 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5076 KB Output is correct
24 Correct 3 ms 5036 KB Output is correct
25 Correct 4 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 4 ms 5160 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 2 ms 5028 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 5084 KB Output is correct
36 Correct 2 ms 4996 KB Output is correct
37 Correct 3 ms 5036 KB Output is correct
38 Correct 3 ms 5028 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 2 ms 5028 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5028 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5028 KB Output is correct
47 Correct 25 ms 9860 KB Output is correct
48 Correct 25 ms 9892 KB Output is correct
49 Correct 38 ms 8984 KB Output is correct
50 Correct 36 ms 9048 KB Output is correct
51 Correct 37 ms 8976 KB Output is correct
52 Correct 37 ms 9152 KB Output is correct
53 Correct 36 ms 9044 KB Output is correct
54 Correct 36 ms 9136 KB Output is correct
55 Correct 39 ms 9092 KB Output is correct
56 Correct 35 ms 8968 KB Output is correct
57 Correct 36 ms 8940 KB Output is correct
58 Correct 35 ms 8960 KB Output is correct
59 Correct 32 ms 9152 KB Output is correct
60 Correct 25 ms 9692 KB Output is correct
61 Correct 24 ms 9868 KB Output is correct
62 Correct 35 ms 13112 KB Output is correct
63 Correct 63 ms 18596 KB Output is correct
64 Correct 73 ms 18468 KB Output is correct
65 Correct 46 ms 12004 KB Output is correct
66 Correct 48 ms 11872 KB Output is correct
67 Correct 44 ms 12276 KB Output is correct
68 Correct 45 ms 11616 KB Output is correct
69 Correct 49 ms 10468 KB Output is correct
70 Correct 47 ms 11684 KB Output is correct
71 Correct 49 ms 11760 KB Output is correct
72 Correct 49 ms 10924 KB Output is correct
73 Correct 56 ms 14808 KB Output is correct
74 Correct 57 ms 15172 KB Output is correct
75 Correct 64 ms 18612 KB Output is correct
76 Correct 62 ms 19136 KB Output is correct
77 Correct 61 ms 18992 KB Output is correct
78 Correct 64 ms 17712 KB Output is correct