제출 #1281738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281738		muhammad-mutahir	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	352 ms	16600 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;
void io(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    // freopen("outputf.in","w",stdout);
    #endif
}

int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n;
    map<int,int>las;
    vector<int>l(n,0);
    for(int i = 0;i<n;i++){
    	// l.pb()
    	cin>>l[i];
    	las[l[i]] = i;
    }
    int c = l[0];
    for(int i = 0;i<n;i++){
    	if(i!= las[c]){
    		cout<<c<<endl;
    	}
    	else{
    		cout<<c<<endl;
    		if(i+1<n){
    			c = l[i+1];
    		}
    	}
    }

    


}


signed main(){
    // io();

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void io()':
Main.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen("input.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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