oj.uz

Submission #846385

# Submission time Handle Problem Language Result Execution time Memory
846385 2023-09-07T14:13:46 Z vjudge1 KOVANICE (COI15_kovanice) C++
10 / 100
 2000 ms 51956 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
	long long a,b,c,d,e,t;
	scanf("%lld %lld %lld",&a,&b,&c);
	string kel;
	long long arr[b + 5];
	vector <long long> es[b + 5];
	queue <long long> que;
	vector <long long> ana;
	memset(arr,0,sizeof(arr));
	string str[c + 5];
	vector <pair <long long,long long> > adj[b + 5];
	d=0;
	for(long long i=0;b>i;i++){
		es[i].push_back(i);
	}
	for(long long i=0;c>i;i++){
		char kl;
		long long h,m;
		scanf("%lld%c%lld",&h,&kl,&m);
		if(kl == '='){
			adj[h-1].push_back(make_pair(m-1,0));
			adj[m-1].push_back(make_pair(h-1,0));
		}
		else{
			adj[m-1].push_back(make_pair(h-1,1));
			arr[h-1]++;
		}
	}
	for(long long i=0;b>i;i++){
		if(arr[i] == 0){
			ana.push_back(i);
		}
	}
	memset(arr,-1,sizeof(arr));
	for(long long i=0;ana.size()>i;i++){
	long long vis[b + 5];
	memset(vis,0,sizeof(vis));
	long long cakmaarr[b + 5];
	memset(cakmaarr,-1,sizeof(cakmaarr));
	que.push(ana[i]);	

	cakmaarr[ana[i]] = 0;
	long long pivot,enb;
	enb=0;
	while(que.size()){
		pivot = que.front();
		que.pop();
		if(vis[pivot] == 0){
			vis[pivot] = 1;
			for(long long j=0;adj[pivot].size()>j;j++){
				if(vis[adj[pivot][j].first] == 0 ){
					cakmaarr[adj[pivot][j].first] = cakmaarr[pivot] + adj[pivot][j].second;
					if(enb < (cakmaarr[pivot] + adj[pivot][j].second)){
						enb = cakmaarr[pivot] + adj[pivot][j].second;
					}
					que.push(adj[pivot][j].first);


				}
			}
		}
	}
	if(a == (enb + 1)){
		for(long long j=0;b>j;j++){
			if(cakmaarr[j] != -1){
				arr[j]=cakmaarr[j];
			}
		}
	}
	}
		for(long long i=0;b>i;i++){
			if(arr[i] != -1){
				printf("K%lld \n",(a - arr[i]));
			}
			else{
				printf("?\n");
			}
		}
	




	
}

Compilation message

kovanice.cpp: In function 'int main()':
kovanice.cpp:37:30: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   37 |  for(long long i=0;ana.size()>i;i++){
      |                    ~~~~~~~~~~^~
kovanice.cpp:52:39: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   52 |    for(long long j=0;adj[pivot].size()>j;j++){
      |                      ~~~~~~~~~~~~~~~~~^~
kovanice.cpp:4:18: warning: variable 'd' set but not used [-Wunused-but-set-variable]
    4 |  long long a,b,c,d,e,t;
      |                  ^
kovanice.cpp:4:20: warning: unused variable 'e' [-Wunused-variable]
    4 |  long long a,b,c,d,e,t;
      |                    ^
kovanice.cpp:4:22: warning: unused variable 't' [-Wunused-variable]
    4 |  long long a,b,c,d,e,t;
      |                      ^
kovanice.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 |  scanf("%lld %lld %lld",&a,&b,&c);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
kovanice.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%lld%c%lld",&h,&kl,&m);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2044 ms 28976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2029 ms 51956 KB Time limit exceeded
2 Halted 0 ms 0 KB -