Submission #46638

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46638	2018-04-22T12:24:44 Z	Jatana	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	322 ms	7608 KB

foehn_phenomena

/*
                                                                                                     
                                             `-:://:::-                                             
                                           `//:-------:/:`                                          
                                          .+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .o:--...```..---+/`                                        
                                       `/y+o/---....---:+o.                                         
                                   `...````-os+/:---:/+o/--.`                                       
              `-/+++++/:.      `...`       :h+d+oooo+/+-`   ...                                     
            `/++//:::://++-`....`         -.`//````````:`     `..`                                  
           `o+/::------://o/`           `-` -.          -`       `..`                               
 `---.-o/:./o/::-..``..-ЗАПУСКАЕМ      ..  ..            -`        `...       ``..``                
  `....o+:-++/:--.```..-://s.        `-`  .-              -`          `-o: .-//::::/:-`             
          `:s+/:--....-::/+s-`      .-   `-                -`           -///:--------:/:`           
           ./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ        `+:--........--:/`          
            .:ooo+++++osso-`    `.:-...`/` ./::-------:/:`   -`         :+--..``````.--:+:...-+:-`  
             `.-/+++++/+-.-`    -.   ``:so:/:--.......--:+`  `-```````o+/+--..`````..--:o/-..:s+:.  
                 ```````:``.. `-`     -` `+:--..`````..--/+-.../.`````..-o:--.......---/o.    `     
                        `:  `:-      -.  .o:--..`` ``..--:o`   `-`      `:o+:--------:+o-`          
                         `-`-...    ..   .o/--...```..--:+/`    `-`     `oy/so/////++o/.`           
                          -/`  `-` `- ``+s/o/:---...---:++.      `-`   .-../d://///:-.`             
                `.---..``-..-    .-/..`````-oo+/:::::/+o+-        `-``-`  `-.  ````                 
             `:++++/+++++-  ..``.-/:`      /y-:/++o++/:.`..`       ./.   `-                         
            -++/::::::://+/..:-``:` ..   `-.`  ```.```    `..`   `..`-` `-                          
       ``  -o//:--....-::/++` -.-`   `-`.-`                 `..`..`  `-.-                           
  -----ss+:++/:--.```..-://s.  /.     `::                    `-:.     ./`                           
  `````/:..+o/::-..``.--:/+s. ..-`   `-``-`                 ..` `-`  `-`-`                          
          `-s+/::-----::/+oo---``-` ..    .:-    ```      .-`     .-.-  `-`                         
           `:oo+//::://+os/..:`..-/:`      :y.-:::::::.`.-`        ./-`  `-`                        
            `./+oooooooo+/.`-    .-:...`.. .//:-------://`        `- `..` `:.                       
              ``.-::::-.``-/`  `-` `-  `oo:+:--.......--:/`      `-    `.:--h.``..```               
                          -.-`.-    .-   `+:--..`````..--//`    `-       /s-//::::::::.             
                         -` `/-      ..  .o:--..`` ``..--:o.```.-        `//:--------://`           
                        -` .-`.-`     -.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`          
                       ..`-.   `-.   ``:os:o/:---...---:++.  `-     ``///+:-..``````.--:+-````-.`   
              `.:///////.-`      .:-..` -``-+o+/:::::/+o/.  `-         `:+:-..`````..--:o/:--/ys+-  
            `-++///////+o/. ``....`-.    :` `.:++++++/:.`  .-           -o/---......---/o.   `.`    
           `++//:-----::/+o:..`     .-`   :    ```````    .-           `+so+:--------:++-`          
  `````:-``:o/::-..`..--:/+o`         -.  `-             .-          `../../+o+////+o+:.`           
  -----syo/o+/:--.```..-://s.          .-` `-           .-        `...     ``-:////:-``             
       .` `/s//:--....-::/+s.            -. `-`        .-       `..`                                
           .+o+/:::--:://+s/-..`          .::+y  ```  .-     `..`                                   
            ./oo++////+oso-`   `....       :y-+:::::::/`   ...                                      
             `.:+oooooo/-`         `....-. .//:-------:/:-.`                                        
                ``...``                 /+:+:--.......--:+`                                         
                                         `+:--..`````..--//`                                        
                                         .o:--..`` ``..--:o`                                        
                                         .+/--...```..--:+/`                                        
                                         `-o/:---...---:++.                                         
                                          `-+o+/:---:/+o/.                                          
                                            `.:+oooo+/-.`                                           
                                               ``````                                               
*/

#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>

#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define umap unordered_map
#define uset unordered_set
#define elif else if
#define len(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--) 
#define apply(v, act) for (auto &x : v) { act; }
#define fuck(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}

#define print    \
smart_io::precall_print(); \
cout,

#define scan cin,

#ifdef fast_allocator
const int MAXMEM = 50000000;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif

using namespace std;

char string_in_buffer[(int)260];


void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) { 
	scanf("%c", &x); 
	if (x == '\n') {
		fast_scan(x);
	}
}
void fast_scan(string &x) {
	scanf("%s", string_in_buffer);
	x = string(string_in_buffer);
}

template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
	fast_scan(p.first);
	fast_scan(p.second);
}

template <class T>
void fast_scan(vector<T> &v) {
	for (auto &x : v) fast_scan(x);
}

void fast_print(const int &x) { printf("%d", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const char &x) { printf("%c", x); };
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }

template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
	fast_print(p.first);
	fast_print(' ');
	fast_print(p.second);
}

template <class T>
void fast_print(const vector<T> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print(' ');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const vector<vector<T>> &v) {
	if (v.empty()) return;
	fast_print(v[0]);
	for (int i = 1; i < v.size(); i++) {
		fast_print('\n');
		fast_print(v[i]);
	}
}

template <class T>
void fast_print(const T &v) {
	for (const auto &x : v) {
		fast_print(x);
		fast_print(' ');
	}
}


using namespace std;


namespace smart_io {
	string print_start = "";
	string sep = " ";
	bool first_print = false;

	void precall_print() {
		fast_print(print_start);
		print_start = "\n";
		first_print = true;
	}

	void _print(deque<string>) {}
	template<class T, class... Args>
	void _print(deque<string> names, T kek, Args... args) {
		if (!first_print) {
			fast_print("\n");
		} else {
			first_print = false;
		}
		fast_print(names.front());
		fast_print(" = ");
		fast_print(kek);
		names.pop_front();
		_print(names, args...);
	}
} //namespace smart_io


template <class T>
ostream &operator,(ostream &os, const T &object) {
	if (!smart_io::first_print) {
		fast_print(smart_io::sep);
	} else {
		smart_io::first_print = false;
	}
	fast_print(object);
	return os;
}

template <class T>
istream &operator,(istream &is, T &object) {
	fast_scan(object);
	return is;
}

#define int long long

namespace typedefs {
	typedef long long ll;
	typedef unsigned long long ull;
	typedef pair<int, int> pii;
	typedef long double ld;
}

namespace numbers_operation {
	template<class T>
	T floor_mod(T a, T b) {
		if (a % b == 0) return 0;
		if (a >= 0 && b >= 0) return a % b;
		if (a <= 0 && b <= 0) return a % b;
		return abs(b) - (abs(a) % abs(b));
	}
}

using namespace numbers_operation;
using namespace typedefs;

int n, q, up, down;
vector<int> v;

struct Node {
	Node *l = NULL, *r = NULL;
	int value = 0;
	int mod = 0;
	int tl, tr;

	bool is_list() {
		return tl + 1 == tr;
	}

	bool included_by(int ql, int qr) {
		return ql <= tl && tr <= qr;
	}

	bool intersects(int ql, int qr) {
		return !(tr <= ql || qr <= tl);
	}

	Node(int _tl, int _tr, const vector<int> &from) {
		tl = _tl;
		tr = _tr;

		if (!is_list()) {
			int mid = (tl + tr) / 2;
			l = new Node(tl, mid, from);
			r = new Node(mid, tr, from);
		} else {
			value = from[tl];
		}
	}

	void push() {
		if (is_list()) {
			value += mod;
		} else {
			l->mod += mod;
			r->mod += mod;
			value += mod;
		}	
		mod = 0;
	}

	int get_value() {
		return value + mod;	
	}

	void update(int ql, int qr, int d) {
		push();
		if (included_by(ql, qr)) {
			mod += d;
		} else {
			if (l->intersects(ql, qr)) {
				l->update(ql, qr, d);
			}
			if (r->intersects(ql, qr)) {
				r->update(ql, qr, d);
			}
			value = l->get_value() + r->get_value();
		}
	}

	int get(int ind) {
		push();
		if (is_list()) {
			return value;
		} else {
			if (ind < l->tr) {
				return l->get(ind);
			} else {
				return r->get(ind);
			}
		}
	}
};

struct FNV {
	int n;
	vector<int> T;
	
	void __inc(int i, int d) {
		for (; i < n; i = (i | (i + 1))) {
			T[i] += d;
		}
	}

	int __get(int i) {
		int rez = 0;
		for (; i >= 0; i = (i & (i + 1)) - 1) {
			rez += T[i];
		}
		return rez;
	}

	FNV(vector<int> src) {
		n = len(src) + 1;
		T.resize(n);
		f(i, len(src)) {
			__inc(i, src[i]);
			__inc(i + 1, -src[i]);
		}
	}

	void update(int l, int r, int d) {
		__inc(l, d);
		__inc(r, -d);
	}

	int get(int i) {
		return __get(i);
	}
};

signed main(signed argc, char *argv[]) {
	{
		scan n, q, up, down;
		n++;
		v.resize(n);
	}	
	{
		scan v;
	}
	FNV fen(v);
	auto get_change = [&fen](int i) {
		if (!(0 <= i && i < n - 1)) return 0LL;
		if (fen.get(i + 1) > fen.get(i)) {
			return abs(fen.get(i + 1) - fen.get(i)) * up;
		} else {
			return -abs(fen.get(i + 1) - fen.get(i)) * down;
		}
	};
	ll temp = 0;
	{
		f(i, n - 1) {
			temp += get_change(i);
		}
	}
	{
		f(i, q) {
			int l, r, d;
			scan l, r, d;
			r++;
			temp -= get_change(l - 1);
			temp -= get_change(r - 1);
			fen.update(l, r, d);
			temp += get_change(l - 1);
			temp += get_change(r - 1);
			print -temp;
		}
	}
}

Compilation message

foehn_phenomena.cpp: In function 'void fast_scan(int&)':
foehn_phenomena.cpp:131:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(int &x) { scanf("%d", &x); }
                          ~~~~~^~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(long long int&)':
foehn_phenomena.cpp:132:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long long &x) { scanf("%lld", &x); }
                                ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(long long unsigned int&)':
foehn_phenomena.cpp:133:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
                                         ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(double&)':
foehn_phenomena.cpp:134:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(double &x) { scanf("%lf", &x); }
                             ~~~~~^~~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(long double&)':
foehn_phenomena.cpp:135:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void fast_scan(long double &x) { scanf("%Lf", &x); }
                                  ~~~~~^~~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(char&)':
foehn_phenomena.cpp:137:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%c", &x); 
  ~~~~~^~~~~~~~~~
foehn_phenomena.cpp: In function 'void fast_scan(std::__cxx11::string&)':
foehn_phenomena.cpp:143:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", string_in_buffer);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	5 ms	552 KB	Output is correct
3	Correct	4 ms	552 KB	Output is correct
4	Correct	4 ms	612 KB	Output is correct
5	Correct	4 ms	612 KB	Output is correct
6	Correct	5 ms	612 KB	Output is correct
7	Correct	6 ms	612 KB	Output is correct
8	Correct	6 ms	612 KB	Output is correct
9	Correct	6 ms	612 KB	Output is correct
10	Correct	6 ms	688 KB	Output is correct
11	Correct	6 ms	688 KB	Output is correct
12	Correct	4 ms	688 KB	Output is correct
13	Correct	5 ms	688 KB	Output is correct
14	Correct	6 ms	784 KB	Output is correct
15	Correct	4 ms	784 KB	Output is correct
16	Correct	5 ms	784 KB	Output is correct
17	Correct	3 ms	788 KB	Output is correct
18	Correct	3 ms	788 KB	Output is correct
19	Correct	2 ms	788 KB	Output is correct
20	Correct	2 ms	788 KB	Output is correct
21	Correct	2 ms	788 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	278 ms	5412 KB	Output is correct
2	Correct	306 ms	5752 KB	Output is correct
3	Correct	279 ms	6352 KB	Output is correct
4	Correct	250 ms	6352 KB	Output is correct
5	Correct	252 ms	6352 KB	Output is correct
6	Correct	193 ms	6792 KB	Output is correct
7	Correct	192 ms	6792 KB	Output is correct
8	Correct	270 ms	6792 KB	Output is correct
9	Correct	254 ms	6920 KB	Output is correct
10	Correct	255 ms	6920 KB	Output is correct
11	Correct	189 ms	6920 KB	Output is correct
12	Correct	176 ms	7048 KB	Output is correct
13	Correct	194 ms	7560 KB	Output is correct

Subtask #3

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	5 ms	552 KB	Output is correct
3	Correct	4 ms	552 KB	Output is correct
4	Correct	4 ms	612 KB	Output is correct
5	Correct	4 ms	612 KB	Output is correct
6	Correct	5 ms	612 KB	Output is correct
7	Correct	6 ms	612 KB	Output is correct
8	Correct	6 ms	612 KB	Output is correct
9	Correct	6 ms	612 KB	Output is correct
10	Correct	6 ms	688 KB	Output is correct
11	Correct	6 ms	688 KB	Output is correct
12	Correct	4 ms	688 KB	Output is correct
13	Correct	5 ms	688 KB	Output is correct
14	Correct	6 ms	784 KB	Output is correct
15	Correct	4 ms	784 KB	Output is correct
16	Correct	5 ms	784 KB	Output is correct
17	Correct	3 ms	788 KB	Output is correct
18	Correct	3 ms	788 KB	Output is correct
19	Correct	2 ms	788 KB	Output is correct
20	Correct	2 ms	788 KB	Output is correct
21	Correct	2 ms	788 KB	Output is correct
22	Correct	278 ms	5412 KB	Output is correct
23	Correct	306 ms	5752 KB	Output is correct
24	Correct	279 ms	6352 KB	Output is correct
25	Correct	250 ms	6352 KB	Output is correct
26	Correct	252 ms	6352 KB	Output is correct
27	Correct	193 ms	6792 KB	Output is correct
28	Correct	192 ms	6792 KB	Output is correct
29	Correct	270 ms	6792 KB	Output is correct
30	Correct	254 ms	6920 KB	Output is correct
31	Correct	255 ms	6920 KB	Output is correct
32	Correct	189 ms	6920 KB	Output is correct
33	Correct	176 ms	7048 KB	Output is correct
34	Correct	194 ms	7560 KB	Output is correct
35	Correct	273 ms	7560 KB	Output is correct
36	Correct	322 ms	7560 KB	Output is correct
37	Correct	277 ms	7568 KB	Output is correct
38	Correct	279 ms	7568 KB	Output is correct
39	Correct	276 ms	7568 KB	Output is correct
40	Correct	277 ms	7568 KB	Output is correct
41	Correct	280 ms	7568 KB	Output is correct
42	Correct	275 ms	7568 KB	Output is correct
43	Correct	299 ms	7568 KB	Output is correct
44	Correct	277 ms	7568 KB	Output is correct
45	Correct	276 ms	7568 KB	Output is correct
46	Correct	277 ms	7568 KB	Output is correct
47	Correct	198 ms	7568 KB	Output is correct
48	Correct	251 ms	7608 KB	Output is correct
49	Correct	276 ms	7608 KB	Output is correct
50	Correct	206 ms	7608 KB	Output is correct
51	Correct	195 ms	7608 KB	Output is correct
52	Correct	195 ms	7608 KB	Output is correct