oj.uz

답안 #131553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131553 2019-07-17T09:29:57 Z MrTEK Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 3872 KB 

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long int ll;
typedef pair <int,int> ii;
 
const int N = 2e3 + 5;
 
vector <int> v;
int mark[N][N],d[N][N];
 
void bridge(int x,int y) {	
	Bridge(min(x,y),max(x,y));
}
 
void solve(vector <int> v) {
	if (v.size() < 2)
		return;
	if (v.size() == 2) {
		bridge(v[0],v[1]);
		return;
	}
	for (int i = 1 ; i < v.size() ; i++) {
		if (mark[v[0]][i])
			continue;
		vector <int> nv;
		nv.push_back(i);
		mark[v[0]][i] = 1;
		for (int j = i + 1 ; j < v.size() ; j++)
			if (mark[v[0]][j] == 0) {
				int temp = Query(v[0],v[i],v[j]);
				if (temp != v[0]) {
					mark[v[0]][j] = 1;
					nv.push_back(j);
					if (temp != v[i])
						d[v[0]][i] = 1;
					if (temp != v[j])
						d[v[0]][j] = 1;
				}
			}
		vector <int> nv2;
		for (auto i : nv)
			nv2.push_back(v[i]);
		for (int j = 0 ; j < nv.size() ; j++) {
			if (d[v[0]][nv[j]])
				continue;
			bool flag = true;
			for (int k = j + 1 ; k < nv.size() ; k++) {
				if (d[v[0]][nv[k]])
					continue;
				int temp = Query(v[0],v[nv[j]],v[nv[k]]);
				if (temp != v[nv[j]]) {
					flag = false;
					d[v[0]][nv[j]] = 1;
					break;
				}
				if (temp != v[nv[k]]) {
					d[v[0]][nv[k]] = 1;
				}
			}
			if (flag == true) {
				bridge(v[0],v[nv[j]]);
				break;
			}
		}
		solve(nv2);
	}
 
}
 
void Solve(int n) {
	for (int i = 0 ; i < n ; i++)
		v.push_back(i);
	solve(v);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:26:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1 ; i < v.size() ; i++) {
                   ~~^~~~~~~~~~
meetings.cpp:32:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i + 1 ; j < v.size() ; j++)
                        ~~^~~~~~~~~~
meetings.cpp:47:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0 ; j < nv.size() ; j++) {
                    ~~^~~~~~~~~~~
meetings.cpp:51:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = j + 1 ; k < nv.size() ; k++) {
                         ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 3 ms 632 KB Output is correct
24 Correct 2 ms 632 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 3 ms 760 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 3 ms 632 KB Output is correct
24 Correct 2 ms 632 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 3 ms 760 KB Output is correct
27 Correct 52 ms 1912 KB Output is correct
28 Correct 43 ms 1784 KB Output is correct
29 Correct 27 ms 1656 KB Output is correct
30 Correct 45 ms 2088 KB Output is correct
31 Correct 34 ms 1784 KB Output is correct
32 Correct 67 ms 2168 KB Output is correct
33 Correct 65 ms 1912 KB Output is correct
34 Correct 86 ms 2296 KB Output is correct
35 Correct 54 ms 1784 KB Output is correct
36 Correct 32 ms 1656 KB Output is correct
37 Correct 14 ms 1528 KB Output is correct
38 Correct 18 ms 1528 KB Output is correct
39 Correct 163 ms 3872 KB Output is correct

Subtask #4
0 / 71.0

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