제출 #1172969

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

Main

#include <bits/extc++.h>

#define int long long 
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define tam(x)  (int)(x).size()
#define endl '\n'
#define sd second
#define fs first
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define optmizar_io  ios_base::sync_with_stdio(0); cin.tie(0);
#define Setpre(n) cout << fixed <<setprecision(n)
#define dbg(x) for(auto y: x) cout << y <<' '; cout << endl;
#define dbg1(x) for(auto y: x) cout << y.first <<' '<< y.second << endl;
#define dbg2(v) for(auto x: v) cout << x.a<< ' '<< x.b <<' '<< x.c << endl;

const int MAX = 501;
const int INF = 1e9;
const int Mod = 1e9+7;
const int zero = 0;
const double eps = 1e-6;
const double PI=acos(-1.0);
const int mox[8] ={-1,1,0,0,-1,-1,1,1};
const int moy[8] ={0,0,-1,1,-1,1,-1,1};

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
typedef vector<bool> vbol;
typedef array<int, 3> arr;

template <typename T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;


void cases(string s){
#ifndef ONLINE_JUDGE
    if(tam(s) == 0) s = "1"; 
    string a = s + ".in";
    string b = s + ".out";
    freopen(a.c_str(), "r", stdin);
    freopen(b.c_str(), "w",  stdout);
#endif
}


void _1()
{
    int n; cin >> n;
    
    vi ar(n);
    for(auto &x : ar) cin >> x;

    map<int,int> mp;
    vector<pi> asd;
    vector<int> ans(n);
    stack<pi> pq;

    for(int i = 0; i < n; i++)
    {
        int x = ar[i];
        if(mp[x] == 1)
        {
            while(pq.top().first != x) mp[pq.top().first] = 0, pq.pop();
            asd.push_back({pq.top().second, i});
        }        
        else  mp[x] = 1, pq.push({x, i});
    }

    reverse(all(asd));
    for(auto [x, y] : asd)
    {
        if(ans[x] != 0) continue;
        for(int i = x; i <= y; i++) ans[i] = ar[x];
    }
    for(int i = 0; i < n; i++)
    {
        if(ans[i] == 0) ans[i] = ar[i];
    }
    for(int i = 0; i < n; i++) cout << ans[i] << endl;
    
}

    

int32_t main() {
    optmizar_io 
    // cases("");

    //start:  
    //end: 
    //tags: 
    //difficulty:
    //comment: 
    
    int T = 1; //cin >> T;
    while(T--)
        _1();


    return 0;
}

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

Main.cpp: In function 'void cases(std::string)':
Main.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen(a.c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(b.c_str(), "w",  stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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