oj.uz

Submission #948730

# Submission time Handle Problem Language Result Execution time Memory
948730 2024-03-18T12:44:45 Z yeediot Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 92 ms 13224 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 a[mxn];
int dif[mxn];
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,q,s,t;
    cin>>n>>q>>s>>t;
    int nsum=0,sum=0;
    for(int i=0;i<=n;i++){
        cin>>a[i];
        if(!i)continue;
        dif[i]=a[i]-a[i-1];
        if(dif[i]>=0)sum+=dif[i];
        else nsum+=dif[i];
    }
    debug(sum,nsum);
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;
        if(dif[l]>=0)sum-=dif[l];
        else nsum-=dif[l];
        dif[l]+=x;
        if(dif[l]>=0)sum+=dif[l];
        else nsum+=dif[l];
        if(r!=n and dif[r+1]>=0)sum-=dif[r+1];
        else if(r!=n) nsum-=dif[r+1];
        dif[r+1]-=x;
        if(r!=n and dif[r+1]>=0)sum+=dif[r+1];
        else if(r!=n) nsum+=dif[r+1];
        cout<<-sum*s-nsum*t<<'\n';
    }//0 4 -3 7
}
 /*
 input:
 
 */

Compilation message

foehn_phenomena.cpp: In function 'void setIO(std::string)':
foehn_phenomena.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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 10140 KB Output is correct
2 Correct 92 ms 10792 KB Output is correct
3 Correct 78 ms 11348 KB Output is correct
4 Correct 74 ms 10580 KB Output is correct
5 Correct 82 ms 11740 KB Output is correct
6 Correct 68 ms 11088 KB Output is correct
7 Correct 65 ms 11036 KB Output is correct
8 Correct 74 ms 11856 KB Output is correct
9 Correct 80 ms 12008 KB Output is correct
10 Correct 76 ms 10796 KB Output is correct
11 Correct 59 ms 10864 KB Output is correct
12 Correct 63 ms 11344 KB Output is correct
13 Correct 68 ms 12000 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 73 ms 10140 KB Output is correct
23 Correct 92 ms 10792 KB Output is correct
24 Correct 78 ms 11348 KB Output is correct
25 Correct 74 ms 10580 KB Output is correct
26 Correct 82 ms 11740 KB Output is correct
27 Correct 68 ms 11088 KB Output is correct
28 Correct 65 ms 11036 KB Output is correct
29 Correct 74 ms 11856 KB Output is correct
30 Correct 80 ms 12008 KB Output is correct
31 Correct 76 ms 10796 KB Output is correct
32 Correct 59 ms 10864 KB Output is correct
33 Correct 63 ms 11344 KB Output is correct
34 Correct 68 ms 12000 KB Output is correct
35 Correct 87 ms 10324 KB Output is correct
36 Correct 74 ms 11876 KB Output is correct
37 Correct 75 ms 12628 KB Output is correct
38 Correct 78 ms 12368 KB Output is correct
39 Correct 78 ms 12512 KB Output is correct
40 Correct 83 ms 12412 KB Output is correct
41 Correct 77 ms 12288 KB Output is correct
42 Correct 75 ms 12332 KB Output is correct
43 Correct 73 ms 11604 KB Output is correct
44 Correct 75 ms 12112 KB Output is correct
45 Correct 70 ms 11988 KB Output is correct
46 Correct 92 ms 13224 KB Output is correct
47 Correct 66 ms 11608 KB Output is correct
48 Correct 69 ms 11800 KB Output is correct
49 Correct 68 ms 10656 KB Output is correct
50 Correct 64 ms 11600 KB Output is correct
51 Correct 64 ms 11776 KB Output is correct
52 Correct 62 ms 11604 KB Output is correct