oj.uz

답안 #990705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990705 2024-05-31T04:51:45 Z vjudge1 Dijamant (COI16_dijament) C++17
13 / 100
 92 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 1e3+5;
map<string, int> st;
vector<int> G[N];

int main()
{
  int n;
  cin >> n;
  int cur = 0;
  for(int i = 0; i < n; i ++)
    {
      string k;
      cin >> k;
      string temp; cin >> temp;

      bool ok = true;
      ok &= (st.count(k) == 0);
      
      while(true)
	{
	  cin >> temp;
	  if(temp == ";")
	    break;
	  if(st.count(temp) == 0)
	    ok = false;
	  else
	    G[cur].push_back(st[temp]);
	}
      
      if(ok)
	{
	  int cnt[cur] = {0};
	  for(int l : G[cur])
	    for(int j : G[l])
	      cnt[j]++;

	  for(int j = 0; j < cur; j++)
	    if(cnt[j] > 1)
	      ok = false;

	  if(ok)
	    {
	      st[k] = cur++;
	      cout << "ok\n";
	    }
	  else
	    cout << "greska\n";
	}
      else
	cout << "greska\n";
    }
  return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 92 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -