제출 #1365314

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1365314		temurbek1371	Art Exhibition (JOI18_art)	C++20	100 / 100	102 ms	16160 KiB

art

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast") 
// #pragma GCC target("avx,avx2,fma")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vb vector<bool>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define endl '\n'
#define maxx(x) *max_element(all(x))
#define pii pair<int,int>
#define minn(x) *min_element(all(x))
#define vpii vector<pii>
#define di deque<int>
#define mii map<int,int>
#define vap(x) vector<array<int,x>>
constexpr int MOD = (1e9 + 7);
constexpr int inf = 1e18;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}
ostream& operator<<(ostream& out, vi& a) {
    for (int i = 0; a.size() > i; i++)out << a[i] << ' ';
    return out;
}
ostream& operator<<(ostream& out, vector<vi>& a) {
    for (auto& row : a) {
        for (auto& elem : row) out << elem << ' ';
        out << '\n';
    }
    return out;
}
istream& operator>>(istream& in, vi& a) {
    for (int i = 0; a.size() > i; i++) in >> a[i];
    return in;
}
istream& operator>>(istream& in, vector<vi>& a) {
    for(int i = 0;i<a.size();i++){
        for(int j = 0;j<a[i].size();j++){
            in >> a[i][j];
        }
    }
    return in;
}
int sumofvecor(vi a){
    int sm = 0;
    for(int i = 0;i<a.size();i++)sm+=a[i];
    return sm;
}
bool isprime(int number){
    for(int i = 2;i*i<=number;i++){
        if(number%i==0)return false;
    }
    return number>=2;
}
void file_io() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
}
void solve();
signed main(signed argc, char *argv[]) {
    clock_t start = clock();
    fast_io();
    // file_io();
    if (argc > 1 && string(argv[1]) == "gg") file_io();
    int test = 1;
    // cin >> test;
    while (test--) {
        solve();
    }
    cerr << "Vaqt " << double(clock() - start) / double(CLOCKS_PER_SEC) * 1000 << " ms\n";
}
vi nx;
vi st;
int n;
void build(){
    for(int i = 1;i<=n;i++)st[n+i-1]=nx[i];
    for(int i = n-1;i>=1;i--)st[i]=min(st[i<<1],st[i<<1|1]);
}
void update(int ind,int vl){
    ind = n+ind-1;
    st[ind]=vl;
    while(ind>1){
        ind>>=1;
        st[ind]=min(st[ind<<1],st[ind<<1|1]);
    }
}
int get(int l,int r){
    l = l+n-1,r = r+n-1;
    int ans = inf;
    while(l<=r){
        if(l%2==1)ans = min(ans,st[l++]);
        if(r%2==0)ans = min(ans,st[r--]);
        l>>=1,r>>=1;
    }
    return ans;
}
void solve(){
    int n;
    cin>>n;
    vpii a(n);
    vi ts;
    for(int i = 0;i<n;i++)cin>>a[i].first>>a[i].second;
    for(int i = 0;i<n;i++)ts.push_back(a[i].second);
    sort(all(a));
    for(int i = 1;i<n;i++)a[i].second+=a[i-1].second;
    // for(int i = 0;i<n;i++)cout<<a[i].first<<' '<<a[i].second<<endl;
    int mx = 0;
    vi s(n);
    for(int i = n-1;i>=0;i--){
        s[i]=a[i].second-a[i].first;
        if(i!=n-1)s[i]=max(s[i],s[i+1]);
    }
    for(int i = 0;i<n-1;i++){
        mx = max(mx,s[i]-(i==0?0:a[i-1].second)+a[i].first);
    }
    cout<<mx<<endl;
    // cout<<s<<endl;
}

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

art.cpp: In function 'void file_io()':
art.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• 서브태스크 1: 10 / 10
• 서브태스크 2: 20 / 20
• 서브태스크 3: 20 / 20
• 서브태스크 4: 50 / 50