oj.uz

Submission #135665

# Submission time Handle Problem Language Result Execution time Memory
135665 2019-07-24T09:33:11 Z eohomegrownapps Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 7488 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
//Query(int a, int b, int c)
//Bridge(int first, int second)
//edges from 0 to n-1

typedef long long ll;
ll acns = 100000000;
ll bcns = 10000;
unordered_map<ll,int> querymap;
int n;
int squery(int a, int b, int c){
	//cout<<"query "<<a<<" "<<b<<" "<<c<<endl;
	if (a>b){
		swap(a,b);
	}
	if (b>c){
		swap(b,c);
	}
	if (a>b){
		swap(a,b);
	}
	if (b>c){
		swap(b,c);
	}
	ll q = a*acns+b*bcns+c;
	auto f = querymap.find(q);
	if (f==querymap.end()){
		return querymap[q]=Query(a,b,c);
	} else {
		return (*f).second;
	}
}
int sortstart, sortend;
bool sfunction(int a, int b){
	return (squery(sortstart,a,b)==a);
}

void solverecursive(int start, vector<int> &arrayUsing){
	//cout<<"===="<<endl;
	/*for (int i : arrayUsing){
		cout<<i<<" ";
	}cout<<endl;*/
	int end = arrayUsing[0];
	deque<int> row;
	row.push_back(start);
	row.push_back(end);
	vector<vector<int> > children(n);
	for (int i = 1; i<arrayUsing.size(); i++){
		int node = squery(start,end,arrayUsing[i]);
		if (node==start){
			row.push_front(arrayUsing[i]);
			start=arrayUsing[i];
		} else if (node==end){
			row.push_back(arrayUsing[i]);
			end=arrayUsing[i];
		} else if (node==arrayUsing[i]){
			sortstart=start;
			//row[row.size()-1]=node;
			row.insert(lower_bound(next(row.begin(),1),row.end(),node,sfunction),node);
			//row.push_back(end);
		} else {
			children[node].push_back(arrayUsing[i]);
		}
		/*for (int r : row){
			cout<<r<<" ";
		}cout<<endl;*/
	}
	//sort
	/*if (row.size()>3){
		auto b = next(row.begin(),1);
		auto e = prev(row.end(),1);
		sortstart=start;
		sortend=end;
		sort(b,e,sfunction);
	}*/
	for (int i = 0; i<row.size()-1; i++){
		//cout<<"bridge "<<min(row[i],row[i+1])<<" "<<max(row[i],row[i+1])<<endl;
		Bridge(min(row[i],row[i+1]),max(row[i],row[i+1]));
		if (children[row[i]].size()==0){
			continue;
		} else if (children[row[i]].size()==1){
			//cout<<"bridge "<<min(row[i],children[row[i]][0])<<" "<<max(row[i],children[row[i]][0])<<endl;
			Bridge(min(row[i],children[row[i]][0]),max(row[i],children[row[i]][0]));
		} else {
			solverecursive(row[i],children[row[i]]);
		}
	}//add case where i=row.size()-1
}
void Solve(int N) {
	n = N;
	vector<int> arrayUsing;
	arrayUsing.resize(n-1,0);
	for (int i = 1; i<n; i++){
		arrayUsing[i-1]=i;
	}
	solverecursive(0,arrayUsing);
}

Compilation message

meetings.cpp: In function 'void solverecursive(int, std::vector<int>&)':
meetings.cpp:50:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i<arrayUsing.size(); i++){
                  ~^~~~~~~~~~~~~~~~~~
meetings.cpp:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i<row.size()-1; i++){
                  ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 244 KB Output is correct
5 Correct 2 ms 248 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 3 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 244 KB Output is correct
5 Correct 2 ms 248 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 3 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 244 KB Output is correct
5 Correct 2 ms 248 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 3 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 6 ms 504 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 7 ms 504 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 7 ms 424 KB Output is correct
33 Correct 11 ms 632 KB Output is correct
34 Correct 12 ms 504 KB Output is correct
35 Correct 11 ms 636 KB Output is correct
36 Correct 6 ms 504 KB Output is correct
37 Correct 15 ms 504 KB Output is correct
38 Correct 14 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 1544 KB Output is correct
2 Correct 592 ms 1584 KB Output is correct
3 Correct 622 ms 1556 KB Output is correct
4 Correct 602 ms 1548 KB Output is correct
5 Correct 289 ms 1392 KB Output is correct
6 Correct 283 ms 1404 KB Output is correct
7 Correct 430 ms 2072 KB Output is correct
8 Correct 454 ms 2112 KB Output is correct
9 Correct 476 ms 2392 KB Output is correct
10 Correct 484 ms 2416 KB Output is correct
11 Correct 519 ms 2348 KB Output is correct
12 Correct 374 ms 1420 KB Output is correct
13 Correct 212 ms 1368 KB Output is correct
14 Correct 387 ms 1800 KB Output is correct
15 Correct 274 ms 1680 KB Output is correct
16 Correct 339 ms 1792 KB Output is correct
17 Correct 455 ms 2340 KB Output is correct
18 Execution timed out 2615 ms 7488 KB Time limit exceeded
19 Halted 0 ms 0 KB -