oj.uz

답안 #59858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59858 2018-07-23T08:11:34 Z Eae02 새 집 (APIO18_new_home) C++14
0 / 100
 5000 ms 26288 KB 
#include <bits/stdc++.h>

#define ALL(x) x.begin(),x.end()

struct Store
{
	long pos;
	long type;
	long oYear;
	long cYear;
};

int main()
{
	long numStores, numTypes, numQ;
	std::cin >> numStores;
	std::cin >> numTypes;
	std::cin >> numQ;
	
	std::vector<Store> stores(numStores);
	for (long s = 0; s < numStores; s++)
	{
		std::cin >> stores[s].pos;
		std::cin >> stores[s].type;
		std::cin >> stores[s].oYear;
		std::cin >> stores[s].cYear;
		stores[s].type--;
	}
	
	std::vector<long> maxDist(numTypes);
	
	for (long i = 0; i < numQ; i++)
	{
		long pos, year;
		std::cin >> pos;
		std::cin >> year;
		
		std::fill(ALL(maxDist), -1);
		
		for (long s = 0; s < numStores; s++)
		{
			if (stores[s].cYear < year || stores[s].oYear > year)
				continue;
			long dist = std::abs(stores[s].pos - pos);
			maxDist[stores[s].type] = std::max(maxDist[stores[s].type], dist);
		}
		
		long inconv = -1;
		for (long d : maxDist)
		{
			if (d == -1)
			{
				inconv = -1;
				break;
			}
			inconv = std::max(inconv, d);
		}
		
		std::cout << inconv << std::endl;
	}
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 476 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Incorrect 2 ms 572 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 476 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Incorrect 2 ms 572 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5034 ms 19052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5064 ms 26288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 476 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Incorrect 2 ms 572 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 476 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Incorrect 2 ms 572 KB Output isn't correct
5 Halted 0 ms 0 KB -