제출 #1165299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165299		AgentPengin	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	151 ms	13384 KiB

Main

/**
 *    author:  AgentPengin ( Độc cô cầu bại )
 *    created: 23.12.2022 10:08:02
 *    too lazy to update time
**/
#include<bits/stdc++.h>

#define EL '\n'
#define fi first
#define se second
#define NAME "TASK"
#define ll long long
#define lcm(a,b) (a/gcd(a,b))*b
#define db(val) "["#val" = " << (val) << "] "
#define bend(v) (v).begin(),(v).end()
#define sz(v) (int)(v).size()
#define ex exit(0)

using namespace std;

const ll mod = 1e9 + 7;
const int inf = 0x1FFFFFFF;
const int MAXN = 2e5 + 5;

int n, a[MAXN], ans[MAXN];
map<int,int> lst;

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    if (ifstream(NAME".inp")) {
        freopen(NAME".inp","r",stdin);
        freopen(NAME".out","w",stdout);
    }
    cin >> n;
    for (int i = 1;i <= n;i++) cin >> a[i];
   	
    for (int i = 1;i <= n;i++) {
    	// if (lst.find(a[i]) == lst.end()) {
    		// lst[a[i]] = i;
    	// }
    	lst[a[i]] = i;
    }
    // cout << lst[1] << '\n';
    memset(ans, -1, sizeof ans);
    for (int i = 1;i <= n;i++) {
    	if (ans[i] == -1) {
    		for (int j = i;j <= lst[a[i]];j++) ans[j] = a[i];
    	}
    }
    for (int i = 1;i <= n;i++) cout << ans[i] << '\n';
    
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
// agent pengin wants to take apio (with anya-san)

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

Main.cpp: In function 'int main()':
Main.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         freopen(NAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen(NAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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