# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125214 | omar1312 | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 200005;
ll a[N+2], dp[N+2], col[N+2];
void solve(){
int n;
cin>>n;
for(int i = 0; i < n; i++){
cin>>a[i];
col[i] = a[i];
}
stack<array<ll, 2>> s;
map<ll, ll> mp;
vector<array<ll, 2>> v;
for(int i = 0; i < n; i++){
if(mp[a[i]]){
while(s.top()[1] != a[i]){
mp[s.top()[1]]--;
s.pop();
}
v.pb({i, s.top()[0]});
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |