oj.uz

답안 #216578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
216578 2020-03-27T14:55:15 Z Benq 치료 계획 (JOI20_treatment) C++14
100 / 100
 222 ms 7408 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

/**
 * Description: 1D point update, range query where \texttt{comb} is
 	* any associative operation. If $N$ is not power of 2 then 
 	* operations work but \texttt{seg[1] != query(0,N-1)}.
 * Time: O(\log N)
 * Source: 
	* http://codeforces.com/blog/entry/18051
	* KACTL
 * Verification: SPOJ Fenwick
 */

template<class T> struct Seg { // comb(ID,b) = b
	const T ID = {2*MOD,2*MOD}; T comb(T a, T b) { return min(a,b); } 
	int n; vector<T> seg;
	void init(int _n) { n = _n; seg.assign(2*n,ID); }
	void pull(int p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(int p, T val) { // set val at position p
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(int l, int r) {	// sum on interval [l, r]
		T ra = ID, rb = ID; 
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};

Seg<pi> S[2];
int N,M;

// if b[2] < a[2]:
// b[0]-b[2] < a[1]+2-a[2]
// else:
// b[0]+b[2] < a[1]+2+a[2]

vector<array<int,4>> v;

typedef pair<ll,int> T;
priority_queue<T,vector<T>,greater<T>> pq;

void del(int x, ll y) {
	F0R(i,2) S[i].upd(x,{2*MOD,x});
	y += v[x][3];
	//dbg("DEL",x,y);
	pq.push({y,x});
}

void process(int x, ll y) {
	dbg(x,y);
	if (v[x][2] == N) {
		ps(y);
		exit(0);
	}
	while (1) {
		auto a = S[0].query(0,x-1); //assert(a.s != 2*MOD);
		if (!(a.f < v[x][2]+2-v[x][0])) break;
		del(a.s,y);
	}
	while (1) {
		auto a = S[1].query(x+1,M-1); //assert(a.s != 2*MOD);
		if (!(a.f < v[x][2]+2+v[x][0])) break;
		del(a.s,y);
	}
}

int main() {
	setIO(); re(N,M);
	v.rsz(M); re(v); sort(all(v));
	// ps("HA",v);
	// T,L,R,C
	dbg(v);
	S[0].init(M), S[1].init(M);
	F0R(i,M) {
		S[0].upd(i,{v[i][1]-v[i][0],i});
		S[1].upd(i,{v[i][1]+v[i][0],i});
		if (v[i][1] == 1) del(i,0);
	}
	while (sz(pq)) {
		auto a = pq.top(); pq.pop();
		process(a.s,a.f);
	}
	ps(-1);
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

treatment.cpp: In function 'void process(int, ll)':
treatment.cpp:185:10: warning: statement has no effect [-Wunused-value]
  dbg(x,y);
          ^
treatment.cpp: In function 'int main()':
treatment.cpp:207:8: warning: statement has no effect [-Wunused-value]
  dbg(v);
        ^
treatment.cpp: In function 'void setIn(std::__cxx11::string)':
treatment.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
treatment.cpp: In function 'void setOut(std::__cxx11::string)':
treatment.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 4984 KB Output is correct
2 Correct 137 ms 5112 KB Output is correct
3 Correct 170 ms 5752 KB Output is correct
4 Correct 176 ms 5752 KB Output is correct
5 Correct 174 ms 7280 KB Output is correct
6 Correct 194 ms 5328 KB Output is correct
7 Correct 188 ms 4984 KB Output is correct
8 Correct 116 ms 5112 KB Output is correct
9 Correct 116 ms 5112 KB Output is correct
10 Correct 110 ms 5112 KB Output is correct
11 Correct 151 ms 7280 KB Output is correct
12 Correct 161 ms 7280 KB Output is correct
13 Correct 177 ms 7280 KB Output is correct
14 Correct 172 ms 7280 KB Output is correct
15 Correct 188 ms 5076 KB Output is correct
16 Correct 185 ms 5112 KB Output is correct
17 Correct 178 ms 5112 KB Output is correct
18 Correct 156 ms 7152 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 12 ms 640 KB Output is correct
21 Correct 11 ms 640 KB Output is correct
22 Correct 12 ms 532 KB Output is correct
23 Correct 11 ms 512 KB Output is correct
24 Correct 11 ms 640 KB Output is correct
25 Correct 14 ms 640 KB Output is correct
26 Correct 13 ms 640 KB Output is correct
27 Correct 16 ms 640 KB Output is correct
28 Correct 11 ms 640 KB Output is correct
29 Correct 12 ms 640 KB Output is correct
30 Correct 9 ms 512 KB Output is correct
31 Correct 9 ms 512 KB Output is correct
32 Correct 11 ms 768 KB Output is correct
33 Correct 11 ms 768 KB Output is correct
34 Correct 13 ms 640 KB Output is correct
35 Correct 9 ms 640 KB Output is correct
36 Correct 11 ms 768 KB Output is correct
37 Correct 13 ms 524 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 4984 KB Output is correct
2 Correct 137 ms 5112 KB Output is correct
3 Correct 170 ms 5752 KB Output is correct
4 Correct 176 ms 5752 KB Output is correct
5 Correct 174 ms 7280 KB Output is correct
6 Correct 194 ms 5328 KB Output is correct
7 Correct 188 ms 4984 KB Output is correct
8 Correct 116 ms 5112 KB Output is correct
9 Correct 116 ms 5112 KB Output is correct
10 Correct 110 ms 5112 KB Output is correct
11 Correct 151 ms 7280 KB Output is correct
12 Correct 161 ms 7280 KB Output is correct
13 Correct 177 ms 7280 KB Output is correct
14 Correct 172 ms 7280 KB Output is correct
15 Correct 188 ms 5076 KB Output is correct
16 Correct 185 ms 5112 KB Output is correct
17 Correct 178 ms 5112 KB Output is correct
18 Correct 156 ms 7152 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 12 ms 640 KB Output is correct
39 Correct 11 ms 640 KB Output is correct
40 Correct 12 ms 532 KB Output is correct
41 Correct 11 ms 512 KB Output is correct
42 Correct 11 ms 640 KB Output is correct
43 Correct 14 ms 640 KB Output is correct
44 Correct 13 ms 640 KB Output is correct
45 Correct 16 ms 640 KB Output is correct
46 Correct 11 ms 640 KB Output is correct
47 Correct 12 ms 640 KB Output is correct
48 Correct 9 ms 512 KB Output is correct
49 Correct 9 ms 512 KB Output is correct
50 Correct 11 ms 768 KB Output is correct
51 Correct 11 ms 768 KB Output is correct
52 Correct 13 ms 640 KB Output is correct
53 Correct 9 ms 640 KB Output is correct
54 Correct 11 ms 768 KB Output is correct
55 Correct 13 ms 524 KB Output is correct
56 Correct 184 ms 5752 KB Output is correct
57 Correct 176 ms 6260 KB Output is correct
58 Correct 174 ms 5120 KB Output is correct
59 Correct 200 ms 5112 KB Output is correct
60 Correct 179 ms 5104 KB Output is correct
61 Correct 174 ms 5112 KB Output is correct
62 Correct 208 ms 5804 KB Output is correct
63 Correct 175 ms 5112 KB Output is correct
64 Correct 189 ms 4984 KB Output is correct
65 Correct 184 ms 5112 KB Output is correct
66 Correct 159 ms 4984 KB Output is correct
67 Correct 213 ms 5224 KB Output is correct
68 Correct 202 ms 4984 KB Output is correct
69 Correct 216 ms 5112 KB Output is correct
70 Correct 214 ms 5240 KB Output is correct
71 Correct 208 ms 4984 KB Output is correct
72 Correct 221 ms 5096 KB Output is correct
73 Correct 207 ms 5240 KB Output is correct
74 Correct 107 ms 4984 KB Output is correct
75 Correct 112 ms 5112 KB Output is correct
76 Correct 173 ms 7280 KB Output is correct
77 Correct 155 ms 6260 KB Output is correct
78 Correct 193 ms 7284 KB Output is correct
79 Correct 221 ms 5240 KB Output is correct
80 Correct 222 ms 5112 KB Output is correct
81 Correct 113 ms 4984 KB Output is correct
82 Correct 221 ms 5368 KB Output is correct
83 Correct 211 ms 5240 KB Output is correct
84 Correct 205 ms 5112 KB Output is correct
85 Correct 181 ms 5112 KB Output is correct
86 Correct 177 ms 5116 KB Output is correct
87 Correct 185 ms 4984 KB Output is correct
88 Correct 209 ms 5112 KB Output is correct
89 Correct 184 ms 4984 KB Output is correct
90 Correct 166 ms 7280 KB Output is correct
91 Correct 110 ms 4984 KB Output is correct
92 Correct 179 ms 5240 KB Output is correct
93 Correct 199 ms 5112 KB Output is correct
94 Correct 216 ms 5240 KB Output is correct
95 Correct 190 ms 5112 KB Output is correct
96 Correct 147 ms 6260 KB Output is correct
97 Correct 166 ms 7280 KB Output is correct
98 Correct 179 ms 7280 KB Output is correct
99 Correct 161 ms 7408 KB Output is correct
100 Correct 159 ms 7280 KB Output is correct
101 Correct 175 ms 7280 KB Output is correct
102 Correct 175 ms 7280 KB Output is correct
103 Correct 150 ms 5368 KB Output is correct