제출 #744519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744519		nvujica	Dijamant (COI16_dijament)	C++14	13 / 100	2056 ms	360 KiB

dijament

#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 1010;

int n, cnt;
bool ok;
map <string, int> mp;
int d[maxn];
int bio[maxn];
vector <int> par[maxn];

void rek(int x, int br){
	if(bio[x] && bio[x] != br){
		ok = 0;
		return;
	}
	
	bio[x] = br;
	
	for(int i = 0; i < par[x].size(); i++){
		rek(par[x][i], br);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for(int j = 0; j < n; j++){
		string k, p;
		cin >> k;
		cin >> p;
		
		ok = 1;
		
		if(mp[k]) ok = 0;
		
		vector <pair<int, int> > v;
		
		while(true){
			cin >> p;
			
			if(p == ";") break;
			
			if(!mp[p]) ok = 0;
			else {
				v.push_back({d[mp[p]], mp[p]});
			}
		}
		
		sort(v.begin(), v.end());
		reverse(v.begin(), v.end());
		
		memset(bio, 0, sizeof bio);
		
		for(int i = 0; i < v.size(); i++){
			int x = v[i].se;
			
			if(!bio[x]) rek(x, i + 1);
		}
		
		if(!ok){
			cout << "greska\n";
			continue;
		}
		
		cout << "ok\n";
		
		cnt++;
		mp[k] = cnt;
		
		if(!v.empty()) d[cnt] = v[0].fi + 1;
		
		for(int i = 0; i < v.size(); i++){
			par[cnt].push_back(v[i].se);
		}
	}
	
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dijament.cpp: In function 'void rek(int, int)':
dijament.cpp:26:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for(int i = 0; i < par[x].size(); i++){
      |                 ~~^~~~~~~~~~~~~~~
dijament.cpp: In function 'int main()':
dijament.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |   for(int i = 0; i < v.size(); i++){
      |                  ~~^~~~~~~~~~
dijament.cpp:82:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   for(int i = 0; i < v.size(); i++){
      |                  ~~^~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 29
• Subtask 4: 0 / 44