Submission #979381

#TimeUsernameProblemLanguageResultExecution timeMemory
979381yeediotConstellation 3 (JOI20_constellation3)C++17
100 / 100
141 ms23428 KiB
#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);} #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } struct line{ int a,b; int operator()(const int x)const{ return a*x+b; } }; bool check(line l1,line l2,line l3){ return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a); } const int mxn=2e5+5; int n, m, h[mxn]; long long ans, bit[mxn]; void modify(int p,int v){ for(;p<mxn;p+=p&-p){ bit[p]+=v; } } long long query(int p){ long long res=0; for(;p;p-=p&-p){ res+=bit[p]; } return res; } vector<int>H[mxn]; vector<pair<int,int>>star[mxn]; struct DSU{ int to[mxn]; void init(){ for(int i=0;i<mxn;i++){ to[i]=i; } } int find(int x){ return x==to[x]?x:to[x]=find(to[x]); } void merge(int x,int y){ x=find(x); y=find(y); to[x]=y; } }l,r; signed main(){ setio(); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>h[i]; H[h[i]].pb(i); } cin>>m; for(int i=1;i<=m;i++){ int x,y,c; cin>>x>>y>>c; star[y].pb({x,c}); } l.init(),r.init(); for(int i=1;i<=n;i++){ for(auto [id,c]:star[i]){ int L=r.find(id),R=l.find(id); long long val=query(id); if(c>val){ ans+=val; modify(L,c-val); modify(R+1,val-c); } else{ ans+=c; } } for(auto id:H[i]){ if(id>1 and h[id]>=h[id-1]){ l.merge(id-1,id); r.merge(id,id-1); } if(id<n and h[id]>=h[id+1]){ r.merge(id+1,id); l.merge(id,id+1); } } } cout<<ans<<'\n'; } /* input: */

Compilation message (stderr)

constellation3.cpp: In function 'void setIO(std::string)':
constellation3.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
constellation3.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...