oj.uz

Submission #910139

# Submission time Handle Problem Language Result Execution time Memory
910139 2024-01-18T00:06:11 Z nightfal Simurgh (IOI17_simurgh) C++14
51 / 100
 91 ms 6236 KB 
#include <cstdio>
#include <iostream>
#include <cassert>
#include <vector>
#include <cstdlib>
#include <string>
#include <utility>
#include <tuple>

using namespace std;


std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v);
int count_common_roads(const std::vector<int>& r);

bool isSubtask1(int n) {return n<=7;}
bool isSubtask2(int n) {return n<=50;}
bool isSubtask3(int n) {return n<=240;}

void dfs3(int startNode, int startEdge, int parent, int now, vector<vector<pair<int,int>>>& edgeL, 
            vector<int>& r2, vector<int>& dNode, vector<vector<int>>& alterEdge) {
    dNode[now]=1;
    for(auto& elem: edgeL[now]) {
        int nextNode,nextEdge; tie(nextNode,nextEdge) = elem;
        if (nextNode==parent) continue;
        if (nextNode==startNode) {alterEdge[startEdge].push_back(nextEdge); continue;}
        if (!dNode[nextNode]) {
            r2.push_back(nextEdge);
            dfs3(startNode,startEdge,now,nextNode,edgeL,r2,dNode,alterEdge);
        }
    }
	return;
}
vector<int> subtask3(int n, std::vector<int>& u, std::vector<int>& v) {
    int m = u.size();
    vector<int> r;
    vector<int> treeEdge(m);
	vector<bool> testedEdge(m);

	// Edge list
    vector<vector<pair<int,int>>> edgeL(n);
    for(int i=0; i<m; i++) {
        edgeL[u[i]].push_back(make_pair(v[i],i));
        edgeL[v[i]].push_back(make_pair(u[i],i));
    }
    // printf("Edge list\n");
    // for(int i=0; i<n; i++) {printf("%d: ",i); for(auto& elem: edgeL[i]) printf("(%d,%d) ",elem.first,elem.second); printf("\n");} printf("\n");

    for(int startNode=0; startNode<n; startNode++) {
		// printf("------ startNode = %d ------\n",startNode);
        vector<int> dNode(n); vector<vector<int>> alterEdge(m);
        dNode[startNode] = 1;
        vector<int> r2, r2StartEdgeIdx;
        int secondNode,startEdge; 

        for(auto& elem: edgeL[startNode]) {
            tie(secondNode,startEdge) = elem;
            if (dNode[secondNode]) continue;
            r2.push_back(startEdge);
            r2StartEdgeIdx.push_back(r2.size()-1);
            dfs3(startNode,startEdge,startNode,secondNode,edgeL,r2,dNode,alterEdge);
        }
		
		// printf("r2: "); for(int elem: r2) printf("%d ",elem); printf("\n");
		// printf("r2StartEdgeIdx: "); for(int elem: r2StartEdgeIdx) printf("%d ",elem); printf("\n");
		// printf("alterEdge: \n"); 
		// for(int i=0; i<n; i++) { printf("%d: ",i); for(auto& elem: alterEdge[i]) printf("%d ",elem); printf("\n");}

        // int defaultCount = count_common_roads(r2);
		// tested가 있는 경우에 그것을 가지고 untested의 treeEdge 여부 계산가능

        for(int startEdgeIdx: r2StartEdgeIdx) {
            vector<int> result;
            int maxValue = -1;

            int startEdge = r2[startEdgeIdx], newStartEdge = r2[startEdgeIdx];
			vector<int> cycle; cycle.push_back(startEdge);
            for(int anEdge: alterEdge[startEdge]) cycle.push_back(anEdge);
			// printf("cycle: "); for(int elem: cycle) printf("%d ",elem); printf("\n");

			bool hasTestedEdge = false;
            for(int anEdge: cycle)
				if (testedEdge[anEdge]) {hasTestedEdge = true; newStartEdge = anEdge; break;}
			// printf("hasTestedEdge = %d, newStartEdge = %d\n",hasTestedEdge,newStartEdge);
			if (hasTestedEdge) {
				r2[startEdgeIdx] = newStartEdge;
				maxValue = count_common_roads(r2);
				if (!treeEdge[newStartEdge]) maxValue++;
				r2[startEdgeIdx] = startEdge;
			}
			// printf("maxValue = %d\n",maxValue);

            for(int anEdge: cycle) {
				int temp;
				if (testedEdge[anEdge]) { 
					temp = treeEdge[anEdge]? maxValue:maxValue-1;
				}
				else {
                	r2[startEdgeIdx] = anEdge; 
					testedEdge[anEdge] = true;
                	temp = count_common_roads(r2);
                	maxValue = max(maxValue,temp);
				}
                result.push_back(temp);
            }
			// printf("result: "); for(int elem: result) printf("%d ",elem); printf("\n");

            for(int j=0; j<result.size(); j++) 
				if (result[j] == maxValue) treeEdge[cycle[j]] = 1;
            r2[startEdgeIdx] = startEdge;        
            // printf("testedEdge: "); for(bool elem: testedEdge) printf("%d ",elem); printf("\n");
            // printf("treeEdge:   "); for(int elem: treeEdge) printf("%d ",elem); printf("\n\n");
        }
        
    }
    for(int i=0; i<m; i++) if (treeEdge[i]) r.push_back(i);
    // printf("r: "); for(int elem: r) printf("%d ",elem); printf("\n");
    return r;
}

void dfs(int parent, int now, std::vector<int>& visit, std::vector<vector<int>>& edgeL) {
    visit[now]=1;
    for(int elem: edgeL[now])
        if (elem!=parent && !visit[elem])
			dfs(now,elem,visit,edgeL);
	return;
}

bool isTree(std::vector<int>& r, std::vector<int>& u, std::vector<int>& v) {
    int n = r.size()+1;
    std::vector<vector<int>> edgeL(n);
    for(int i=0; i<n-1; i++) {
        int s = u[r[i]], e = v[r[i]];
        edgeL[s].push_back(e);
        edgeL[e].push_back(s);
    }
    vector<int> visit(n,0);
    dfs(-1,u[r[0]],visit,edgeL);
	for(int i=0; i<n; i++)
		if(!visit[i]) return false;
	return true;
}

bool selectEdges(int cnt, int start, std::vector<int>& r, std::vector<int>& u, std::vector<int>& v){
	int n = r.size()+1, m = u.size();
    if (cnt == n-1){
        if(isTree(r,u,v) && count_common_roads(r)== n-1) return true;
        else return false;
    }
    for(int i=start; i<m; i++){
        r[cnt] = i;
        if (selectEdges(cnt+1,i+1,r,u,v)) return true;
    }
    return false;
}

std::vector<int> subtask1(int n, std::vector<int>& u, std::vector<int>& v) {
    std::vector<int> r(n-1), zero(n-1,-1);
    if (selectEdges(0,0,r,u,v)) return r;
    else return zero;
}

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
    return subtask3(n,u,v);
    // if (isSubtask1(n)) 
    return subtask1(n,u,v);
}

Compilation message

simurgh.cpp: In function 'std::vector<int> subtask3(int, std::vector<int>&, std::vector<int>&)':
simurgh.cpp:108:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             for(int j=0; j<result.size(); j++)
      |                          ~^~~~~~~~~~~~~~
simurgh.cpp: In function 'void dfs(int, int, std::vector<int>&, std::vector<std::vector<int> >&)':
simurgh.cpp:123:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  123 |     for(int elem: edgeL[now])
      |     ^~~
simurgh.cpp:126:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  126 |  return;
      |  ^~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 1 ms 348 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 1 ms 348 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 348 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 348 KB correct
17 Correct 2 ms 348 KB correct
18 Correct 1 ms 440 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 2 ms 348 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 344 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 436 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 600 KB correct
31 Correct 1 ms 344 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 1 ms 348 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 348 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 348 KB correct
17 Correct 2 ms 348 KB correct
18 Correct 1 ms 440 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 2 ms 348 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 344 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 436 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 600 KB correct
31 Correct 1 ms 344 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Correct 90 ms 2484 KB correct
35 Correct 91 ms 2420 KB correct
36 Correct 64 ms 2184 KB correct
37 Correct 7 ms 348 KB correct
38 Correct 90 ms 2456 KB correct
39 Correct 78 ms 2140 KB correct
40 Correct 62 ms 1948 KB correct
41 Correct 90 ms 2488 KB correct
42 Correct 89 ms 2452 KB correct
43 Correct 50 ms 1704 KB correct
44 Correct 41 ms 1340 KB correct
45 Correct 47 ms 1372 KB correct
46 Correct 37 ms 1120 KB correct
47 Correct 17 ms 604 KB correct
48 Correct 3 ms 348 KB correct
49 Correct 7 ms 348 KB correct
50 Correct 17 ms 848 KB correct
51 Correct 47 ms 1372 KB correct
52 Correct 41 ms 1340 KB correct
53 Correct 36 ms 1120 KB correct
54 Correct 52 ms 1696 KB correct
55 Correct 47 ms 1372 KB correct
56 Correct 47 ms 1372 KB correct
57 Correct 47 ms 1372 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Incorrect 62 ms 6236 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 1 ms 348 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 2 ms 348 KB correct
15 Correct 2 ms 348 KB correct
16 Correct 2 ms 348 KB correct
17 Correct 2 ms 348 KB correct
18 Correct 1 ms 440 KB correct
19 Correct 2 ms 348 KB correct
20 Correct 2 ms 348 KB correct
21 Correct 2 ms 348 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 344 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 436 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 600 KB correct
31 Correct 1 ms 344 KB correct
32 Correct 1 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Correct 90 ms 2484 KB correct
35 Correct 91 ms 2420 KB correct
36 Correct 64 ms 2184 KB correct
37 Correct 7 ms 348 KB correct
38 Correct 90 ms 2456 KB correct
39 Correct 78 ms 2140 KB correct
40 Correct 62 ms 1948 KB correct
41 Correct 90 ms 2488 KB correct
42 Correct 89 ms 2452 KB correct
43 Correct 50 ms 1704 KB correct
44 Correct 41 ms 1340 KB correct
45 Correct 47 ms 1372 KB correct
46 Correct 37 ms 1120 KB correct
47 Correct 17 ms 604 KB correct
48 Correct 3 ms 348 KB correct
49 Correct 7 ms 348 KB correct
50 Correct 17 ms 848 KB correct
51 Correct 47 ms 1372 KB correct
52 Correct 41 ms 1340 KB correct
53 Correct 36 ms 1120 KB correct
54 Correct 52 ms 1696 KB correct
55 Correct 47 ms 1372 KB correct
56 Correct 47 ms 1372 KB correct
57 Correct 47 ms 1372 KB correct
58 Correct 1 ms 348 KB correct
59 Correct 0 ms 348 KB correct
60 Incorrect 62 ms 6236 KB WA in grader: NO
61 Halted 0 ms 0 KB -