# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1181811 | pythontest | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 2096 ms | 12148 KiB |
#include <iostream>
#include <unordered_map>
constexpr int N=2e5+10;
int kolorki[N];
using namespace std;
unordered_map<int,int> indeksy;
int main() {
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&kolorki[i]);
if(indeksy[kolorki[i]]!=0){
for(int j=indeksy[kolorki[i]];j<i;j++) {
indeksy[kolorki[j]]=0;
kolorki[j]=kolorki[i];
}
}
indeksy[kolorki[i]]=i;
}
for(int i=1;i<=n;i++) printf("%d\n",kolorki[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |