oj.uz

Submission #780916

# Submission time Handle Problem Language Result Execution time Memory
780916 2023-07-12T14:35:16 Z epicci23 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 187 ms 21236 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in();
  int ar[n+1];
  for(int i=1;i<=n;i++) ar[i]=in();

  vector<array<int,3>> ans;
  map<int,int> mp;

  for(int i=1;i<=n;i++)
  {
    if(!mp[ar[i]])
    {
      mp[ar[i]]=i;
      ans.pb({i,i,ar[i]});
    }
    else
    {
      while(!ans.empty() && ans.back()[0]>mp[ar[i]])
      {
       mp[ans.back()[2]]=0;
       ans.pop_back();
      }
      ans[sz(ans)-1][1]=i;
      mp[ar[i]]=i;
    }
  }

  for(auto x:ans)
    for(int i=x[0];i<=x[1];i++)
      cout << x[2] << endl;
  
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 4 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 212 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 340 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 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 224 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 212 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 19 ms 2268 KB Output is correct
18 Correct 20 ms 2232 KB Output is correct
19 Correct 22 ms 2260 KB Output is correct
20 Correct 21 ms 2252 KB Output is correct
21 Correct 20 ms 2228 KB Output is correct
22 Correct 23 ms 2252 KB Output is correct
23 Correct 21 ms 2200 KB Output is correct
24 Correct 22 ms 2260 KB Output is correct
25 Correct 21 ms 2264 KB Output is correct
26 Correct 21 ms 2200 KB Output is correct
27 Correct 21 ms 2200 KB Output is correct
28 Correct 27 ms 2260 KB Output is correct
29 Correct 22 ms 2260 KB Output is correct
30 Correct 21 ms 2252 KB Output is correct
31 Correct 20 ms 2272 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 4 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 212 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 340 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 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 224 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 212 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 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 19 ms 2268 KB Output is correct
48 Correct 20 ms 2232 KB Output is correct
49 Correct 22 ms 2260 KB Output is correct
50 Correct 21 ms 2252 KB Output is correct
51 Correct 20 ms 2228 KB Output is correct
52 Correct 23 ms 2252 KB Output is correct
53 Correct 21 ms 2200 KB Output is correct
54 Correct 22 ms 2260 KB Output is correct
55 Correct 21 ms 2264 KB Output is correct
56 Correct 21 ms 2200 KB Output is correct
57 Correct 21 ms 2200 KB Output is correct
58 Correct 27 ms 2260 KB Output is correct
59 Correct 22 ms 2260 KB Output is correct
60 Correct 21 ms 2252 KB Output is correct
61 Correct 20 ms 2272 KB Output is correct
62 Correct 33 ms 3796 KB Output is correct
63 Correct 169 ms 18296 KB Output is correct
64 Correct 183 ms 17656 KB Output is correct
65 Correct 32 ms 3620 KB Output is correct
66 Correct 30 ms 3668 KB Output is correct
67 Correct 32 ms 3844 KB Output is correct
68 Correct 32 ms 3804 KB Output is correct
69 Correct 32 ms 3792 KB Output is correct
70 Correct 35 ms 3756 KB Output is correct
71 Correct 32 ms 3816 KB Output is correct
72 Correct 32 ms 3792 KB Output is correct
73 Correct 119 ms 12280 KB Output is correct
74 Correct 134 ms 12536 KB Output is correct
75 Correct 140 ms 21064 KB Output is correct
76 Correct 187 ms 21000 KB Output is correct
77 Correct 150 ms 21236 KB Output is correct
78 Correct 135 ms 20980 KB Output is correct