제출 #407338

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407338		Carmel_Ab1	다리 (APIO19_bridges)	C++17	0 / 100	124 ms	5444 KiB

bridges

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define gcd __gcd
#define popcount __builtin_popcountll
#define mp make_pair

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}
ll ceil(ll a,ll b){
    ll ans=a/b;
    if(a%b)ans++;
    return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M
    ll ans=1;
    while(exp){
        if(exp%2==1)ans=((ans%M)*(base%M))%M;
        base=((base%M)*(base%M))%M;
        exp/=2;
    }
    return ans;
}

string to_base(int n,int new_base){
    string s;
    int nn=n;
    while(nn){
        s+=to_string(nn%new_base);
        nn/=new_base;
    }
    reverse(all(s));
    return s;
}

ll lcm(ll a,ll b){
    ll x= (a/gcd(a,b));
    return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1){
    if(mx==1e18+1)
        mx=n;
    vl ans(n);
    for(int i=0; i<n;i++)
        ans[i]=(mn+rand()%(mx-mn+1));
    return ans;
}
string substr(string s,int l,int r){
    string ans;
    for(int i=l; i<=r; i++)
        ans+=s[i];
    return ans;
}


void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
vi a;
vvi g;
struct seg{
    int sz=1,n=-1;
    vi t;
    seg(int n):n(n){
        while(sz<=2*n)
            sz*=2;
        t.resize(sz,1e9);
    }
    void update(int i,int v){
        t[i+=sz/2]=v;
        while(i){
            t[i/2]=min(t[i],t[i^1]);
            i/=2;
        }
    }
    int mn(int l,int r){
        int ans=1e9;
        for(l+=sz/2,r+=sz/2 +1; l<r; l/=2,r/=2){
            if(l&1)ans=min(ans,t[l++]);
            if(r&1)ans=min(ans,t[--r]);
        }
        return ans;
    }
    int prv(int i,int v){
        int l=1,r=i,ans=i;
        while(l<=r){
            int m=(l+r)/2;
            if(mn(l,m)>=v)
                ans=m,l=m+1;
            else
                r=m-1;
        }
        return ans;
    }
    int nxt(int i,int v){
        int l=i,r=n,ans=i;
        while(l<=r){
            int m=(l+r)/2;
            if(mn(m,r)>=v)
                ans=m,r=m-1;
            else
                l=m+1;
        }
        return ans;
    }
};
void solve() {
    int n,m;
    cin >> n >> m;

    seg s(n+1);

    a.resize(n+1);
    g.resize(n+1);
    for(int i=0; i<n-1; i++){
        int u,v;
        cin >> u >> v;
        cin >> a[i+1];
        s.update(i+1,a[i+1]);
    }
    int q;
    cin >> q;
    while(q--){
        int op;
        cin >> op;
        if(op==1){
            int i,v;
            cin >> i >> v;
            s.update(i,v);
        }
        else {
            int i,mx;
            cin >> i >> mx;
            int l=i-s.prv(i,mx)+1;
            int r=s.nxt(i,mx)-i+1;
            cout << l + r -1 << "\n";
        }
    }

}

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

bridges.cpp: In function 'void usaco(std::string)':
bridges.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27