oj.uz

Submission #131514

# Submission time Handle Problem Language Result Execution time Memory
131514 2019-07-17T08:32:39 Z MrTEK Meetings (JOI19_meetings) C++14
0 / 100
 93 ms 632 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair <int,int> ii;

const int N = 3e2 + 5;

vector <int> v;
int mark[N][N],d[N][N];

void solve(vector <int> v) {
	if (v.size() < 2)
		return;
	if (v.size() == 2) {
		Bridge(v[0],v[1]);	
		return;
	}
	// cerr << "Selam oyun baslasin : " << v[0] << endl;
	for (int i = 1 ; i < v.size() ; i++) {
		if (mark[v[0]][i])
			continue;
		vector <int> nv;
		nv.push_back(v[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(v[j]);
					if (temp != v[i])
						d[v[0]][i] = 1;
					if (temp != v[j])
						d[v[0]][j] = 1;
				}
			}
		// cerr << "yeni agac : " << v[0] << " " << v[i] << "\n";
		for (auto j : nv) {
			// cerr << j << " ";
			if (d[v[0]][j] == 0) {
				// cerr << v[0] << " " << j << endl;
				Bridge(v[0],j);
			}
		}
		// cerr << "\n";
		solve(nv);
	}

}

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:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1 ; i < v.size() ; i++) {
                   ~~^~~~~~~~~~
meetings.cpp:27:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i + 1 ; j < v.size() ; j++)
                        ~~^~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Incorrect 2 ms 420 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Incorrect 2 ms 420 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Incorrect 2 ms 420 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 632 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -