oj.uz

답안 #26742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26742 2017-07-05T11:03:41 Z model_code Sticks (POI11_pat) C++14
28 / 100
 1000 ms 14508 KB 
/*************************************************************************
 *                                                                       *
 *                    XVIII Olimpiada Informatyczna                      *
 *                                                                       *
 *   Zadanie:           Patyczki                                         *
 *   Autor:             Alan Kutniewski                                  *
 *   Opis:              Rozwiazanie bardzo powolne                       *
 *                                                                       *
 *************************************************************************/

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

using namespace std;

struct patyczek{
	int dl; //długość
	char kol; //kolor, nie ma sensu, żeby kol > 50, bo wtedy na pewno będie się dało zbudować trójkąt
}_p;

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

void Solve(){ //sprawdzamy wszystkie możliwości
	for(int a = 0; a < n - 2; ++a){
		for(int b = a + 1; b < n - 1; ++b){
			for(int c = b + 1; c < n; ++c){
				if(p[a].kol != p[b].kol && p[a].kol != p[c].kol && p[b].kol != p[c].kol &&
				p[a].dl + p[b].dl > p[c].dl && p[a].dl + p[c].dl > p[b].dl && p[b].dl + p[c].dl > p[a].dl){
					cout << (int)p[a].kol << " " << p[a].dl << " ";
					cout << (int)p[b].kol << " " << p[b].dl << " ";
					cout << (int)p[c].kol << " " << p[c].dl << "\n";
					exit(0);
				}
			}
		}
	}
	cout << "NIE\n";
}

int main(){
	//Wczytywanie danych
	ios_base::sync_with_stdio(0);
	cin >> k;
	for(int i = 0;i < k; ++i){
		cin >> m;
		n += m;
		_p.kol = i + 1;
		for(int j = 0; j < m; ++j){
			cin >> _p.dl;
			p.push_back(_p);
		}
	}
	Solve();
	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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2180 KB Oczekiwano NIE
2 Execution timed out 1000 ms 2600 KB Execution timed out

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 543 ms 2180 KB Oczekiwano NIE
2 Execution timed out 1000 ms 2988 KB Execution timed out

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 2340 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 2600 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 3756 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 8364 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 8364 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 14508 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 14508 KB Execution timed out
2 Halted 0 ms 0 KB -