oj.uz

Submission #263987

# Submission time Handle Problem Language Result Execution time Memory
263987 2020-08-14T04:38:27 Z kaage New Home (APIO18_new_home) C++17
12 / 100
 2637 ms 12380 KB 
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 2 "main.cpp"
int n,q,k,x[60010],t[60010],a[60010],b[60010],ans[60010];
int l[60010],y[60010];
std::map<int,int> mp[410];
int main(){
	std::cin>>n>>k>>q;
	rep(i,n)std::cin>>x[i]>>t[i]>>a[i]>>b[i];
	rep(i,q)std::cin>>l[i]>>y[i];
	std::vector<std::pair<P,P>> vec;
	rep(i,n){
		vec.push_back({{a[i],0},{x[i],t[i]}});
		vec.push_back({{b[i],2},{x[i],t[i]}});
	}
	rep(i,q){
		vec.push_back({{y[i],1},{l[i],i}});
	}
	std::sort(all(vec));
	rep(i,vec.size()){
		if(vec[i].first.second==0){
			mp[vec[i].second.second][vec[i].second.first]++;
		}
		else if(vec[i].first.second==1){
			int res=0;
			REP(j,k){
				if(mp[j].empty()){
					res=-1;
					break;
				}
				auto it=mp[j].lower_bound(vec[i].second.first);
				int cnt=INF;
				if(it!=mp[j].end())chmin(cnt,it->first-vec[i].second.first);
				if(it!=mp[j].begin())chmin(cnt,vec[i].second.first-std::prev(it)->first);
				chmax(res,cnt);
			}
			ans[vec[i].second.second]=res;
		}
		else{
			mp[vec[i].second.second][vec[i].second.first]--;
			if(!mp[vec[i].second.second][vec[i].second.first])mp[vec[i].second.second].erase(vec[i].second.first);
		}
	}
	rep(i,q)std::cout<<ans[i]<<std::endl;
}

Compilation message

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
main.cpp: In function 'int main()':
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
main.cpp:18:2: note: in expansion of macro 'rep'

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 384 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 4 ms 512 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 384 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 4 ms 512 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2637 ms 11128 KB Output is correct
32 Correct 280 ms 7016 KB Output is correct
33 Correct 553 ms 9052 KB Output is correct
34 Correct 2062 ms 9380 KB Output is correct
35 Correct 1414 ms 11100 KB Output is correct
36 Correct 572 ms 10840 KB Output is correct
37 Correct 525 ms 8936 KB Output is correct
38 Correct 460 ms 8808 KB Output is correct
39 Correct 439 ms 9064 KB Output is correct
40 Correct 455 ms 9064 KB Output is correct
41 Correct 624 ms 8936 KB Output is correct
42 Correct 589 ms 9132 KB Output is correct
43 Correct 507 ms 8424 KB Output is correct
44 Correct 580 ms 8884 KB Output is correct
45 Correct 467 ms 8952 KB Output is correct
46 Correct 417 ms 8808 KB Output is correct
47 Correct 403 ms 8680 KB Output is correct
48 Correct 400 ms 8860 KB Output is correct
49 Correct 419 ms 8808 KB Output is correct
50 Correct 537 ms 8936 KB Output is correct
51 Correct 418 ms 8808 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 156 ms 2332 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 143 ms 2368 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 384 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 4 ms 512 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2637 ms 11128 KB Output is correct
32 Correct 280 ms 7016 KB Output is correct
33 Correct 553 ms 9052 KB Output is correct
34 Correct 2062 ms 9380 KB Output is correct
35 Correct 1414 ms 11100 KB Output is correct
36 Correct 572 ms 10840 KB Output is correct
37 Correct 525 ms 8936 KB Output is correct
38 Correct 460 ms 8808 KB Output is correct
39 Correct 439 ms 9064 KB Output is correct
40 Correct 455 ms 9064 KB Output is correct
41 Correct 624 ms 8936 KB Output is correct
42 Correct 589 ms 9132 KB Output is correct
43 Correct 507 ms 8424 KB Output is correct
44 Correct 580 ms 8884 KB Output is correct
45 Correct 467 ms 8952 KB Output is correct
46 Correct 417 ms 8808 KB Output is correct
47 Correct 403 ms 8680 KB Output is correct
48 Correct 400 ms 8860 KB Output is correct
49 Correct 419 ms 8808 KB Output is correct
50 Correct 537 ms 8936 KB Output is correct
51 Correct 418 ms 8808 KB Output is correct
52 Runtime error 311 ms 12380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 384 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 4 ms 512 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2637 ms 11128 KB Output is correct
32 Correct 280 ms 7016 KB Output is correct
33 Correct 553 ms 9052 KB Output is correct
34 Correct 2062 ms 9380 KB Output is correct
35 Correct 1414 ms 11100 KB Output is correct
36 Correct 572 ms 10840 KB Output is correct
37 Correct 525 ms 8936 KB Output is correct
38 Correct 460 ms 8808 KB Output is correct
39 Correct 439 ms 9064 KB Output is correct
40 Correct 455 ms 9064 KB Output is correct
41 Correct 624 ms 8936 KB Output is correct
42 Correct 589 ms 9132 KB Output is correct
43 Correct 507 ms 8424 KB Output is correct
44 Correct 580 ms 8884 KB Output is correct
45 Correct 467 ms 8952 KB Output is correct
46 Correct 417 ms 8808 KB Output is correct
47 Correct 403 ms 8680 KB Output is correct
48 Correct 400 ms 8860 KB Output is correct
49 Correct 419 ms 8808 KB Output is correct
50 Correct 537 ms 8936 KB Output is correct
51 Correct 418 ms 8808 KB Output is correct
52 Runtime error 156 ms 2332 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -