Submission #990259

#TimeUsernameProblemLanguageResultExecution timeMemory
990259thelegendary08Stone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
213 ms24728 KiB
#include<bits/stdc++.h> #define pb push_back #define ll long long int #define vi vector<int> #define vvi vector<vector<int>> #define vll vector<long long int> #define vvll vector<vector<long long int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vvc vector<vector<char>> #define vb vector<bool> #define mii map<int,int> #define mll map<long long int, long long int> #define mivi map<int,vector<int>> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); int n; cin>>n; vi v(n); f0r(i,n){ cin>>v[i]; } mii p; vi nxt(n, -1); f0r(i,n){ if(p.count(v[i]) != 0){ nxt[i] = p[v[i]]; } p[v[i]] = i; } mii lo; f0r(i,n)lo[v[i]] = i; vb done(n, false); f0r(i,n){ if(done[i])continue; else{ done[i] = 1; if(lo[v[i]] != i){ FOR(j, i, lo[v[i]] + 1){ done[j] = 1; v[j] = v[i]; } } } } f0r(i,n)cout<<v[i]<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...