답안 #1054881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054881 2024-08-12T12:51:32 Z nightfal 기지국 (IOI20_stations) C++14
29 / 100
538 ms 932 KB
// #include "stations.h"
#include <cstdio>
#include <iostream>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;


template <typename T> void print(T elem) {cout << elem << " ";}
template <typename T> void print(vector<T> &v) {for(auto elem: v) print(elem); cout << endl;};
template <typename T> void print(vector<vector<T>> &v) {for(auto elem: v) print(elem); cout << endl;};

int DecideLabelsSubtask(int n, int k, vector<vector<int>> &g, vector<int> &u, vector<int> &v) {
	if (k==pow(10,9)) return n<=8?  4:5;
	else if (k>pow(10,3)) return 3;
	for(auto elem: g) 
		if(elem.size()>2) return 2;
	return 1;
}
void labelsSubtask1(int n, vector<vector<int>> &g, vector<int> &labels) {
	int node = 0;
	for (int i=0; i<n; i++)
		if(g[i].size()==1) node = i;

	for (int i=0; i<n; i++) {
		labels[node] = i;
		for(int child: g[node])
			if(labels[child]== -1) {node = child;}
	}
	return;
}
void labelsSubtask2(int n, vector<int> &labels) {
	for(int i=0; i<n; i++)
		labels[i] = i;
	return;
}
void genLabels3(int key, int node, vector<vector<int>> &g, vector<int> &labels) {
    labels[node]=key*1000+1;
    for(int i=2; i<1000; i++) {
        bool terminal = true;
        for(int child: g[node]) {
            if(labels[child]==-1) {labels[child] = 1000*key+i; node = child; terminal=false;}
        }
        if (terminal) return;
    }
}
void labelsSubtask3(int n, vector<vector<int>> &g, vector<int> &labels) {
	int root = 0;
	for(int i=0; i<n; i++)
		if(g[i].size() > 2)  {root = i; break;}
	labels[root] = 1000;
	for(int i=0; i<g[root].size(); i++) {
		int child = g[root][i];
		genLabels3(i+1, child, g, labels);
	} 
	return;
}
void genLabels4(int base, int key, int exp, int node, vector<vector<int>> &g, vector<int> &labels) {
    labels[node]=base + key*pow(10,exp);
	base = labels[node];

    for(int i=0; i<g[node].size(); i++) {
		int child = g[node][i];
		if (labels[child]==-1) 
        	genLabels4(base,i+1,exp-1, child, g, labels);
    }
	return;
}
void labelsSubtask4(int n, vector<vector<int>> &g, vector<int> &labels) {
	labels[0] = pow(10,8);
	int base = labels[0];
	for(int i=0; i<g[0].size(); i++) {
		int child = g[0][i];
		if (labels[child]==-1) 
			genLabels4(base,i+1,7, child, g, labels);
	}	
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n,-1);
    vector<vector<int>> g(n);
    for (int i=0; i<n-1; i++) {
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
    }
	// print(g);
	int subtask = DecideLabelsSubtask(n,k,g,u,v);
	// cout << "subtask:" << subtask << endl;
	switch(subtask) {
		case 1: labelsSubtask1(n, g, labels); break;
    	case 2: labelsSubtask2(n,labels); break;
		case 3: labelsSubtask3(n,g,labels); break;
		case 4: labelsSubtask4(n,g,labels);
	}
    // print(labels);
	return labels;
}
bool ancestor(int s, int t) {
    if (s==0) return true;
    while (t) {
        if (s==t) return true;
        t = (t-1)>>1;
    }
    return false;
}
int decideFindSubtask(int s, int t, vector<int> &c) {
	if (s>pow(10,8) || t>pow(10,8)) return 4;
    else if (s>1'000 || t>1'000) return 3;
	switch(s) {
		case 0:
			if (c.size()==1) return 1;
			else if (c.size()==2) return 2;
		case 1:
			if (t==0) return -1;
			else {
				for(int elem: c) 
					if(elem > 2) return 2;
				return 1;
			}
		default:
			for(int i=0; i<c.size(); i++)
				if(!(c[i]==s-1 || c[i]==s+1)) return 2;
			return 1;
	}
}
int find_next_station(int s, int t, std::vector<int> c) {
    int subtask = decideFindSubtask(s,t,c);

	switch(subtask) {
		case -1: return 0;
		case 1: 
	        for(int child: c)
    	        if (s<t && s<child) return child;
        	    else if (s>t && s>child) return child;
		case 2:
	        if (ancestor(2*s+1,t)) return 2*s+1;
    	    else if (ancestor(2*s+2,t)) return 2*s+2;
        	else return (s-1)/2;
		case 3:
			if (s==1000) return (t/1000)*1000+1;
			else if (s/1000 == t/1000) {
				if (s<t) return s+1;
				else return s-1;
			}
			else { 
				if (s%1000==1) return 1000;
				else return s-1;
			}
		case 4: 
			int cntZeros=0, s2=s;
			while (s2%2==0) {s2>>=1; cntZeros++;}
			int diff = t^s;
			if(diff >> cntZeros == 0) return (t >> cntZeros-1) << cntZeros-1;
			else return (s >> cntZeros+1) << cntZeros+1;
	}
}

Compilation message

stations.cpp: In function 'void labelsSubtask3(int, std::vector<std::vector<int> >&, std::vector<int>&)':
stations.cpp:55:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int i=0; i<g[root].size(); i++) {
      |               ~^~~~~~~~~~~~~~~
stations.cpp: In function 'void genLabels4(int, int, int, int, std::vector<std::vector<int> >&, std::vector<int>&)':
stations.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0; i<g[node].size(); i++) {
      |                  ~^~~~~~~~~~~~~~~
stations.cpp: In function 'void labelsSubtask4(int, std::vector<std::vector<int> >&, std::vector<int>&)':
stations.cpp:75:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |  for(int i=0; i<g[0].size(); i++) {
      |               ~^~~~~~~~~~~~
stations.cpp: In function 'int decideFindSubtask(int, int, std::vector<int>&)':
stations.cpp:123:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |    for(int i=0; i<c.size(); i++)
      |                 ~^~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:155:51: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  155 |    if(diff >> cntZeros == 0) return (t >> cntZeros-1) << cntZeros-1;
      |                                           ~~~~~~~~^~
stations.cpp:155:66: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  155 |    if(diff >> cntZeros == 0) return (t >> cntZeros-1) << cntZeros-1;
      |                                                          ~~~~~~~~^~
stations.cpp:156:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  156 |    else return (s >> cntZeros+1) << cntZeros+1;
      |                      ~~~~~~~~^~
stations.cpp:156:45: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  156 |    else return (s >> cntZeros+1) << cntZeros+1;
      |                                     ~~~~~~~~^~
stations.cpp:158:1: warning: control reaches end of non-void function [-Wreturn-type]
  158 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 296 ms 684 KB Output is correct
2 Correct 257 ms 684 KB Output is correct
3 Correct 515 ms 684 KB Output is correct
4 Correct 332 ms 684 KB Output is correct
5 Correct 334 ms 684 KB Output is correct
6 Correct 232 ms 684 KB Output is correct
7 Correct 258 ms 684 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 0 ms 776 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 684 KB Output is correct
2 Correct 262 ms 684 KB Output is correct
3 Correct 538 ms 684 KB Output is correct
4 Correct 379 ms 684 KB Output is correct
5 Correct 306 ms 684 KB Output is correct
6 Correct 233 ms 684 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 258 ms 684 KB Output is correct
2 Correct 256 ms 684 KB Output is correct
3 Correct 449 ms 684 KB Output is correct
4 Correct 370 ms 684 KB Output is correct
5 Correct 325 ms 684 KB Output is correct
6 Correct 229 ms 684 KB Output is correct
7 Correct 211 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 764 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Correct 301 ms 684 KB Output is correct
12 Correct 239 ms 768 KB Output is correct
13 Correct 252 ms 932 KB Output is correct
14 Correct 276 ms 684 KB Output is correct
15 Correct 21 ms 764 KB Output is correct
16 Correct 27 ms 760 KB Output is correct
17 Correct 52 ms 740 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 501 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Invalid labels (values out of range). scenario=1, k=1000000000, vertex=0, label=-1
2 Halted 0 ms 0 KB -