| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 131543 |
2019-07-17T09:15:12 Z |
MrTEK |
Meetings (JOI19_meetings) |
C++14 |
|
132 ms |
592 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 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) {
// cerr << "BEBE BRIDGE " << v[0] << " " << v[1] << endl;
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(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;
}
}
// cerr << "yeni agac : " << v[0] << " " << v[i] << "\n";
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 != nv[j]) {
flag = false;
d[v[0]][nv[j]] = 1;
break;
}
else {
d[v[0]][nv[k]] = 1;
}
}
if (flag == true) {
// cerr << "HOLY BRIDGE " << v[0] << " " << v[nv[j]] << endl;
bridge(v[0],v[nv[j]]);
break;
}
}
// cerr << nv2.size() << "anaaa " << endl;
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:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0 ; j < nv.size() ; j++) {
~~^~~~~~~~~~~
meetings.cpp:52:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k = j + 1 ; k < nv.size() ; k++) {
~~^~~~~~~~~~~
| # |
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 |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
376 KB |
Wrong Answer [4] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
376 KB |
Wrong Answer [4] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
376 KB |
Wrong Answer [4] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
132 ms |
592 KB |
Wrong Answer [4] |
| 2 |
Halted |
0 ms |
0 KB |
- |
