이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 4105;
vv(ll) ind[150][N];
ll cnt[N][N];
void solve()
{
ll n, m, k;
cin >> n >> m >> k;
str s[n];
for (str &i : s)
cin >> i;
for (ll i = 0; i < n; i++)
for (ll j = 0; j < m; j++)
ind[s[i][j]][j].pb(i);
for (chr c : {'A', 'C', 'G', 'T'})
for (ll i = 0; i < m; i++)
for (ll j = 0; j < ind[c][i].size(); j++)
for (ll k = j + 1; k < ind[c][i].size(); k++)
cnt[ind[c][i][k]][ind[c][i][j]]++, cnt[ind[c][i][j]][ind[c][i][k]]++;
ll res = 0;
for (ll i = 0; i < n; i++)
{
res = 0;
for (ll j = 0; j < n; j++)
res += cnt[i][j] == m - k;
if (res == n - 1)
{
cout << i + 1 << endl;
return;
}
}
}
/*
*/
int main()
{
ANDROID
// precomp();
ll t = 1;
// cin >> t;
for (ll i = 1; i <= t; i++)
// cout << "Case #" << i << ": ",
solve();
cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}
컴파일 시 표준 에러 (stderr) 메시지
genetics.cpp: In function 'void solve()':
genetics.cpp:56:20: warning: array subscript has type 'char' [-Wchar-subscripts]
56 | ind[s[i][j]][j].pb(i);
| ^
genetics.cpp:59:28: warning: array subscript has type 'char' [-Wchar-subscripts]
59 | for (ll j = 0; j < ind[c][i].size(); j++)
| ^
genetics.cpp:59:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for (ll j = 0; j < ind[c][i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~
genetics.cpp:60:32: warning: array subscript has type 'char' [-Wchar-subscripts]
60 | for (ll k = j + 1; k < ind[c][i].size(); k++)
| ^
genetics.cpp:60:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | for (ll k = j + 1; k < ind[c][i].size(); k++)
| ~~^~~~~~~~~~~~~~~~~~
genetics.cpp:61:17: warning: array subscript has type 'char' [-Wchar-subscripts]
61 | cnt[ind[c][i][k]][ind[c][i][j]]++, cnt[ind[c][i][j]][ind[c][i][k]]++;
| ^
genetics.cpp:61:31: warning: array subscript has type 'char' [-Wchar-subscripts]
61 | cnt[ind[c][i][k]][ind[c][i][j]]++, cnt[ind[c][i][j]][ind[c][i][k]]++;
| ^
genetics.cpp:61:52: warning: array subscript has type 'char' [-Wchar-subscripts]
61 | cnt[ind[c][i][k]][ind[c][i][j]]++, cnt[ind[c][i][j]][ind[c][i][k]]++;
| ^
genetics.cpp:61:66: warning: array subscript has type 'char' [-Wchar-subscripts]
61 | cnt[ind[c][i][k]][ind[c][i][j]]++, cnt[ind[c][i][j]][ind[c][i][k]]++;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |