Submission #1181823

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181823		pythontest	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	54 ms	12148 KiB

Main

#include <iostream>
#include <unordered_map>
constexpr int N=2e5+10;
int kolorki[N],indeks[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){
            indeks[indeksy[kolorki[i]]]=i;
        }
        indeksy[kolorki[i]]=i;
    }
    int ack=kolorki[1],aci=0;
    for(int i=1;i<=n;i++){
        if(aci<=i)
            aci=indeks[i],ack=kolorki[i];
        kolorki[i]=ack;
    }
    for(int i=1;i<=n;i++) printf("%d\n",kolorki[i]);
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d",&kolorki[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40