oj.uz

답안 #26741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26741 2017-07-05T11:03:20 Z model_code Sticks (POI11_pat) C++14
100 / 100
 423 ms 8360 KB 
/*************************************************************************
 *                                                                       *
 *                    XVIII Olimpiada Informatyczna                      *
 *                                                                       *
 *   Zadanie:           Patyczki                                         *
 *   Autor:             Alan Kutniewski                                  *
 *   Zlozonosc czasowa: O(n * lg(n) + k^3 * n)                           *
 *   Opis:              Rozwiazanie powolne                              *
 *                                                                       *
 *************************************************************************/

#include <iostream>
#include <algorithm>
#include <vector>
#define INF 1000000001
#define MAXK 50

using namespace std;

vector <int> p[MAXK]; //vector trzymający patyczki
int n, k, m; //n - ilość patyczków, k - ilość kolorów, m - ilość patyczków w kolorze

void Solve(int a, int b, int c){ //Sprawdza, czy da się ułożyć trójkąt, gdy najdłuższy patyczek jest koloru a, krótszy b, a najkrótszy c
	int bi = -1, ci = -1; //ai, bi, ci - indeks a, b, c
	int as = p[a].size(), bs = p[b].size(), cs = p[c].size();
	for(int ai = 0; ai < as; ++ai){
		//zwiększamy bi
		while(bi + 1 < bs && p[b][bi + 1] <= p[a][ai])++bi;
		//zwiększamy ci
		while(ci + 1 < cs && p[c][ci + 1] <= p[b][bi])++ci;
		//sprawdzamy, czy tworzą trójkąt
		if(bi < 0 || ci < 0 || p[b][bi] > p[a][ai] || p[c][ci] > p[a][ai])continue;
		if(p[a][ai] < p[b][bi] + p[c][ci]){ //wystarczy to sprawdzenie, gdyż p[a][ai] jest najdłuższy
			cout << a + 1 << " " << p[a][ai] << " " << b + 1<< " " << p[b][bi] << " " << c + 1 << " " << p[c][ci] << endl;
			exit(0);//wypisujemy wynik i kończymy program
		}
	}
}

int main(){
	//Wczytywanie danych
	ios_base::sync_with_stdio(0);
	cin >> k;
	for(int i = 0; i < k; ++i){
		cin >> m;
		n += m;
		for(int j = 0; j < m; ++j){
			int adl;
			cin >> adl;
			p[i].push_back(adl);
		}
		sort(p[i].begin(), p[i].end());
	}
	for(int a = 0; a < k - 2; ++a){
		for(int b = a + 1; b < k - 1; ++b){
			for(int c = b + 1; c < k; ++c){
				//wybrane są trzy kolory a b i c
				Solve(a, b, c);
				Solve(a, c, b);
				Solve(b, a, c);
				Solve(b, c, a);
				Solve(c, a, b);
				Solve(c, b, a);
				//sprawdzone wszystkie sześć możliwości
			}
		}
	}
	cout << "NIE\n"; //jeśli Solve nie zakończył programu, to znaczy, że nie da się ułożyć trójkąta
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Oczekiwano NIE

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Oczekiwano NIE
2 Correct 6 ms 2460 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Oczekiwano NIE
2 Correct 13 ms 2500 KB Output is correct

Subtask #7
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Oczekiwano NIE
2 Correct 26 ms 2796 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2324 KB Oczekiwano NIE
2 Correct 39 ms 3248 KB Output is correct
3 Correct 56 ms 2932 KB Oczekiwano NIE

Subtask #9
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 2644 KB Oczekiwano NIE
2 Correct 73 ms 3704 KB Output is correct
3 Correct 103 ms 3180 KB Oczekiwano NIE

Subtask #10
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 5484 KB Output is correct
2 Correct 109 ms 4380 KB Output is correct
3 Correct 116 ms 4172 KB Oczekiwano NIE

Subtask #11
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 4720 KB Output is correct
2 Correct 156 ms 4332 KB Output is correct
3 Correct 239 ms 4156 KB Oczekiwano NIE

Subtask #12
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 7080 KB Output is correct
2 Correct 196 ms 4984 KB Output is correct
3 Correct 263 ms 6072 KB Oczekiwano NIE

Subtask #13
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 8360 KB Output is correct
2 Correct 149 ms 5056 KB Output is correct
3 Correct 423 ms 5452 KB Oczekiwano NIE