oj.uz

Submission #771580

# Submission time Handle Problem Language Result Execution time Memory
771580 2023-07-03T06:40:34 Z Filya Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 2336 KB 
//♥God will make a way♥
 
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////de/////////////////////
ll a[300005], b[300005], l[300005], r[300005];
int main() {
    fastio;
    int n, q; cin >> n >> q;
    fra(n) frb(q) 
    set<pll> s;
    fri(n) l[i] = r[i] = a[i];
    fri(q) {
        frj(n) {
            a[j] += b[i];
            if(b[i] > 0) {
                if(j != n-1 && a[j] > l[j+1])
                    r[j] = max(r[j], l[j+1]);
                else 
                    r[j] = max(r[j], a[j]);

            } else {
                if(j && a[j] < r[j-1])
                    l[j] = min(l[j], r[j-1]);
                else 
                    l[j] = min(l[j], a[j]);
            }

        }
    }
    fri(n) cout << r[i] - l[i] << '\n';
    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 9 ms 416 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 8 ms 416 KB Output is correct
7 Correct 10 ms 428 KB Output is correct
8 Correct 8 ms 412 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 9 ms 416 KB Output is correct
11 Correct 6 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 292 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 9 ms 416 KB Output is correct
16 Correct 8 ms 340 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 6 ms 468 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 9 ms 416 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 8 ms 416 KB Output is correct
7 Correct 10 ms 428 KB Output is correct
8 Correct 8 ms 412 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 9 ms 416 KB Output is correct
11 Correct 6 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 292 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 9 ms 416 KB Output is correct
16 Correct 8 ms 340 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 20 ms 1876 KB Output is correct
21 Correct 24 ms 1876 KB Output is correct
22 Correct 98 ms 1824 KB Output is correct
23 Correct 703 ms 1952 KB Output is correct
24 Execution timed out 2543 ms 2336 KB Time limit exceeded
25 Halted 0 ms 0 KB -