oj.uz

답안 #202230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202230 2020-02-14T10:13:06 Z dolphingarlic GTA (COI14_gta) C++14
100 / 100
 681 ms 644 KB 
#include <bits/stdc++.h>
using namespace std;

map<char, vector<int>> mp = {
	{'A', {1, 0, 3, 4, 5, 6, 7, 2}},
	{'C', {2, 5, 6, 0, 7, 3, 1, 4}},
	{'G', {7, 4, 5, 1, 6, 2, 0, 3}},
	{'T', {4, 7, 1, 6, 2, 0, 3, 5}}
};
			
vector<int> compose(vector<int> base, vector<int> trans) {
	vector<int> ret(8);
	for (int i = 0; i < 8; i++) ret[i] = trans[base[i]];
	return ret;
}

vector<int> perm[100];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		perm[i] = {0, 1, 2, 3, 4, 5, 6, 7};
		string s;
		cin >> s;
		reverse(s.begin(), s.end());
		for (char j : s) perm[i] = compose(perm[i], mp[j]);
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (perm[i] == perm[j]) cout << 1;
			else cout << 0;
		}
		cout << '\n';
	}
	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 12 ms 376 KB Output is correct
9 Correct 71 ms 376 KB Output is correct
10 Correct 681 ms 644 KB Output is correct