oj.uz

답안 #979373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979373 2024-05-10T18:10:51 Z yeediot 별자리 3 (JOI20_constellation3) C++17
100 / 100
 140 ms 36024 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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, ans, h[mxn], bit[mxn];
void modify(int p,int v){
    for(;p<mxn;p+=p&-p){
        bit[p]+=v;
    }
}
int query(int p){
    int 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], num[mxn];
    void init(){
        for(int i=0;i<mxn;i++){
            to[i]=i;
            num[i]=1;
        }
    }
    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);
        /*if(x==y){
            return;
        }
        if(num[x]>num[y]){
            swap(x,y);
        }
        num[y]+=num[x];*/
        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),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

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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 4 ms 19188 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 18948 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 4 ms 19032 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 19032 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19128 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 4 ms 19032 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19036 KB Output is correct
22 Correct 4 ms 19128 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 4 ms 19188 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 18948 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 4 ms 19032 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 19032 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19128 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 4 ms 19032 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19036 KB Output is correct
22 Correct 4 ms 19128 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 5 ms 19060 KB Output is correct
25 Correct 5 ms 19036 KB Output is correct
26 Correct 4 ms 19036 KB Output is correct
27 Correct 5 ms 19068 KB Output is correct
28 Correct 5 ms 19048 KB Output is correct
29 Correct 6 ms 19036 KB Output is correct
30 Correct 6 ms 19052 KB Output is correct
31 Correct 5 ms 19036 KB Output is correct
32 Correct 5 ms 19036 KB Output is correct
33 Correct 5 ms 19036 KB Output is correct
34 Correct 5 ms 19188 KB Output is correct
35 Correct 6 ms 19036 KB Output is correct
36 Correct 5 ms 19036 KB Output is correct
37 Correct 4 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 ms 19036 KB Output is correct
40 Correct 5 ms 19036 KB Output is correct
41 Correct 5 ms 19032 KB Output is correct
42 Correct 4 ms 19032 KB Output is correct
43 Correct 5 ms 19036 KB Output is correct
44 Correct 5 ms 19036 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 4 ms 19188 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 18948 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 4 ms 19032 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 19032 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19128 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 4 ms 19032 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19036 KB Output is correct
22 Correct 4 ms 19128 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 5 ms 19060 KB Output is correct
25 Correct 5 ms 19036 KB Output is correct
26 Correct 4 ms 19036 KB Output is correct
27 Correct 5 ms 19068 KB Output is correct
28 Correct 5 ms 19048 KB Output is correct
29 Correct 6 ms 19036 KB Output is correct
30 Correct 6 ms 19052 KB Output is correct
31 Correct 5 ms 19036 KB Output is correct
32 Correct 5 ms 19036 KB Output is correct
33 Correct 5 ms 19036 KB Output is correct
34 Correct 5 ms 19188 KB Output is correct
35 Correct 6 ms 19036 KB Output is correct
36 Correct 5 ms 19036 KB Output is correct
37 Correct 4 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 ms 19036 KB Output is correct
40 Correct 5 ms 19036 KB Output is correct
41 Correct 5 ms 19032 KB Output is correct
42 Correct 4 ms 19032 KB Output is correct
43 Correct 5 ms 19036 KB Output is correct
44 Correct 5 ms 19036 KB Output is correct
45 Correct 125 ms 33888 KB Output is correct
46 Correct 122 ms 33620 KB Output is correct
47 Correct 140 ms 34108 KB Output is correct
48 Correct 120 ms 33800 KB Output is correct
49 Correct 122 ms 33588 KB Output is correct
50 Correct 132 ms 33616 KB Output is correct
51 Correct 117 ms 33616 KB Output is correct
52 Correct 121 ms 33992 KB Output is correct
53 Correct 116 ms 33876 KB Output is correct
54 Correct 109 ms 36024 KB Output is correct
55 Correct 109 ms 35984 KB Output is correct
56 Correct 115 ms 35680 KB Output is correct
57 Correct 106 ms 35664 KB Output is correct
58 Correct 85 ms 31460 KB Output is correct
59 Correct 95 ms 31668 KB Output is correct
60 Correct 88 ms 34644 KB Output is correct
61 Correct 70 ms 30532 KB Output is correct
62 Correct 116 ms 33620 KB Output is correct
63 Correct 69 ms 29996 KB Output is correct
64 Correct 68 ms 30404 KB Output is correct
65 Correct 110 ms 33416 KB Output is correct
66 Correct 70 ms 29716 KB Output is correct