oj.uz

Submission #691901

# Submission time Handle Problem Language Result Execution time Memory
691901 2023-01-31T23:49:09 Z Paul_Liao_1457 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 129 ms 13136 KB 
//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
 
#define ll long long
#define int ll
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(ll i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(2e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

/*
 
 struct func
 {
     bool operator()(const int &a, const int &b) const
     {
         return a < b;
     }
 };
 
 */
 
using namespace std;
 
template<class T> using PQ=priority_queue<T,vector<T>,greater<T> >;
 
void file(){
    freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
    freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}

ll dis[200005],a[200005];

signed main(){
    AC;
    ll n,q,s,t,c1=0,c2=0; cin>>n>>q>>s>>t;
    FOR(i,0,n+1){
        cin>>a[i];
        if(i){
            dis[i]=a[i]-a[i-1];
            if(dis[i]>0) c1+=dis[i];
            else c2+=dis[i];
        }
    }
    //cout<<"c1="<<c1<<" c2="<<c2<<endl;
    while(q--){
        int l,r,x; cin>>l>>r>>x;
        if(dis[l]>0&&dis[l]+x<=0){
            c1-=dis[l]; c2+=dis[l]+x;
        }
        else if(dis[l]<=0&&dis[l]+x>0){
            c2-=dis[l]; c1+=dis[l]+x;
        }
        else{
            if(dis[l]>0) c1+=x;
            else c2+=x;
        }
        if(r+1<=n){
            if(dis[r+1]>0&&dis[r+1]-x<=0){
                c1-=dis[r+1]; c2+=dis[r+1]-x;
            }
            else if(dis[r+1]<=0&&dis[r+1]-x>0){
                c1+=dis[r+1]-x; c2-=dis[r+1];
            }
            else{
                if(dis[r+1]>0) c1-=x;
                else c2-=x;
            }
        }
        dis[l]+=x; dis[r+1]-=x;
        cout<<-(s*c1+t*c2)<<endl;
    }
}

 
/*
 4 5
 1 2 4 4
 1 3 2 1
 4 3 1 2
 4 1 6 1
 2 4 2 5
 
 */

Compilation message

foehn_phenomena.cpp: In function 'void file()':
foehn_phenomena.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:51:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 10184 KB Output is correct
2 Correct 93 ms 10852 KB Output is correct
3 Correct 99 ms 11476 KB Output is correct
4 Correct 89 ms 10880 KB Output is correct
5 Correct 99 ms 12040 KB Output is correct
6 Correct 100 ms 11008 KB Output is correct
7 Correct 83 ms 11044 KB Output is correct
8 Correct 96 ms 11880 KB Output is correct
9 Correct 93 ms 12112 KB Output is correct
10 Correct 85 ms 10824 KB Output is correct
11 Correct 85 ms 10960 KB Output is correct
12 Correct 77 ms 11676 KB Output is correct
13 Correct 78 ms 11784 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 404 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 99 ms 10184 KB Output is correct
23 Correct 93 ms 10852 KB Output is correct
24 Correct 99 ms 11476 KB Output is correct
25 Correct 89 ms 10880 KB Output is correct
26 Correct 99 ms 12040 KB Output is correct
27 Correct 100 ms 11008 KB Output is correct
28 Correct 83 ms 11044 KB Output is correct
29 Correct 96 ms 11880 KB Output is correct
30 Correct 93 ms 12112 KB Output is correct
31 Correct 85 ms 10824 KB Output is correct
32 Correct 85 ms 10960 KB Output is correct
33 Correct 77 ms 11676 KB Output is correct
34 Correct 78 ms 11784 KB Output is correct
35 Correct 90 ms 10332 KB Output is correct
36 Correct 93 ms 11852 KB Output is correct
37 Correct 99 ms 12604 KB Output is correct
38 Correct 101 ms 12364 KB Output is correct
39 Correct 113 ms 12584 KB Output is correct
40 Correct 95 ms 12364 KB Output is correct
41 Correct 117 ms 12208 KB Output is correct
42 Correct 98 ms 12332 KB Output is correct
43 Correct 97 ms 11712 KB Output is correct
44 Correct 129 ms 12040 KB Output is correct
45 Correct 94 ms 12068 KB Output is correct
46 Correct 97 ms 13136 KB Output is correct
47 Correct 85 ms 11692 KB Output is correct
48 Correct 82 ms 11692 KB Output is correct
49 Correct 88 ms 10628 KB Output is correct
50 Correct 84 ms 11596 KB Output is correct
51 Correct 84 ms 11852 KB Output is correct
52 Correct 73 ms 11652 KB Output is correct