답안 #1024598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024598 2024-07-16T08:29:25 Z Halym2007 Dijamant (COI16_dijament) C++17
13 / 100
24 ms 2384 KB
#include <bits/stdc++.h>
using namespace std;
#define sz size()
#define ll long long
#define pb push_back
const int N = 3e5 + 5;

map <string, int> m;

int main () {
//	freopen ("input.txt", "r", stdin);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		string s, k;
		cin >> s >> k;
		while (1) {
			string y;
			cin >> y;
			if (y[0] == ';') break;
		}
		if (m.find (s) != m.end()) {
			cout << "greska\n";
		}
		else {
//			if (i == 8) {
//				cout << s << " " << k << "\n";
//				return 0;
//			}
			cout << "ok\n";
			m[s] = 1;
		}
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -