oj.uz

답안 #131551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131551 2019-07-17T09:27:30 Z MrTEK Meetings (JOI19_meetings) C++14
29 / 100
 160 ms 1956 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 != 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) {
    				// 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:28:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int i = 1 ; i < v.size() ; i++) {
                       ~~^~~~~~~~~~
meetings.cpp:34:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for (int j = i + 1 ; j < v.size() ; j++)
                            ~~^~~~~~~~~~
meetings.cpp:50:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for (int j = 0 ; j < nv.size() ; j++) {
                        ~~^~~~~~~~~~~
meetings.cpp:54:31: 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 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 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 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 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 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 508 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 424 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 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 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 508 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 424 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 54 ms 1144 KB Output is correct
28 Correct 42 ms 1076 KB Output is correct
29 Correct 25 ms 1016 KB Output is correct
30 Correct 42 ms 1144 KB Output is correct
31 Correct 32 ms 1016 KB Output is correct
32 Correct 66 ms 1468 KB Output is correct
33 Correct 65 ms 1192 KB Output is correct
34 Correct 85 ms 1392 KB Output is correct
35 Correct 53 ms 1148 KB Output is correct
36 Correct 31 ms 1016 KB Output is correct
37 Correct 13 ms 892 KB Output is correct
38 Correct 16 ms 800 KB Output is correct
39 Correct 160 ms 1956 KB Output is correct

Subtask #4
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 132 ms 632 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -