oj.uz

Submission #131578

# Submission time Handle Problem Language Result Execution time Memory
131578 2019-07-17T09:59:41 Z MrTEK Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 3804 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,vec,vec2;
		for (auto i : nv)
			nv2.push_back(v[i]);
        for (auto j : nv)
            if (d[v[0]][j] == 0)
                vec.push_back(v[j]);
    	while(vec.size() != 1) {
            vec2.clear();
            for (int i = 0 ; i < vec.size() ; i += 2) {
                if (i + 1 >= vec.size())
                    vec2.push_back(vec[i]);
                else {
                    int temp = Query(v[0],vec[i],vec[i + 1]);
                    if (temp == vec[i])
                        vec2.push_back(vec[i]);
                    if (temp == vec[i + 1])
                        vec2.push_back(vec[i + 1]);
                }
            }
            swap(vec,vec2);
        }
        bridge(vec[0],v[0]);
		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:24:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1 ; i < v.size() ; i++) {
                   ~~^~~~~~~~~~
meetings.cpp:30:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i + 1 ; j < v.size() ; j++)
                        ~~^~~~~~~~~~
meetings.cpp:50:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i = 0 ; i < vec.size() ; i += 2) {
                              ~~^~~~~~~~~~~~
meetings.cpp:51:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (i + 1 >= vec.size())
                     ~~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 376 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 376 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 3 ms 504 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 508 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 2 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 504 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 376 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 3 ms 504 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 508 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 2 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 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 3 ms 760 KB Output is correct
27 Correct 53 ms 1936 KB Output is correct
28 Correct 44 ms 1912 KB Output is correct
29 Correct 26 ms 1656 KB Output is correct
30 Correct 44 ms 2040 KB Output is correct
31 Correct 33 ms 1784 KB Output is correct
32 Correct 68 ms 2296 KB Output is correct
33 Correct 69 ms 1852 KB Output is correct
34 Correct 90 ms 2380 KB Output is correct
35 Correct 56 ms 1868 KB Output is correct
36 Correct 33 ms 1784 KB Output is correct
37 Correct 14 ms 1656 KB Output is correct
38 Correct 18 ms 1656 KB Output is correct
39 Correct 163 ms 3804 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3038 ms 1944 KB Time limit exceeded
2 Halted 0 ms 0 KB -