oj.uz

답안 #104635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104635 2019-04-08T13:07:56 Z groeneprof Genetics (BOI18_genetics) C++14
0 / 100
 182 ms 27384 KB 
#include <bits/stdc++.h>
#define int long long
#define P(x) do {if(debug) cout << x << endl;} while(false)
#define H(x) P(#x << ": " << x)
#define FR(i, a, b) for(int i = (a); i < (b); ++i)
#define F(i, n) FR(i, 0, n)
#define DR(i, a, b) for(int i = (b); i --> (a);)
#define D(i, n) DR(i, 0, n)
#define S(s) (int)(s).size()
#define ALL(x) (x).begin(), (x).end()
#define MI(x, a) (x) = min(x, a)
#define MA(x, a) (x) = max(x, a)
#define V vector
#define pb push_back
#define mp make_pair
using namespace std;
const bool debug = 0;
const int tries = 3;
const int mod = 1e9+7;
int N,M,K;
vector<vector<int> > people, key;
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	random_device rd;
	mt19937 gen(rd());
	uniform_int_distribution<> dis(0, mod-1);
	map<char,int> mp;
	mp['A'] = 0;
	mp['C'] = 1;
	mp['G'] = 2;
	mp['T'] = 3;
	cin>>N>>M>>K;
	people.resize(N, vector<int> (M, 0));
	key.resize(4, vector<int> (M, 0));
	F(i, N){
		F(j, M){
			char c;
			cin>>c;
			people[i][j] = mp[c];
		}
	}
	int pos = N;
	vector<bool> vv(N, true);
	while(pos>1){
		vector<int> weight(N);
		int sw = 0;
		F(i, N){
			sw += weight[i] = dis(gen);
			sw %= mod;
		}
		key.assign(4, vector<int> (M, 0));
		F(i, N){
			F(j, M){
				key[people[i][j]][j] += weight[i];
				key[people[i][j]][j] %= mod; 
			}
		}
		F(i, N) if(vv[i]){
			int sum = 0;
			F(j, M){
				F(k, 4) if(k != people[i][j]){
					sum += key[k][j];
					sum%=mod;
				}
			}
			if(sum != ((sw-weight[i])*K)%mod && vv[i]){
				P(sum<<" "<<sw*(K));
				P("not "<<i+1);
				pos--;
				vv[i] = false;
			}
		}
	}
	F(i, N){
		if(vv[i]){
			cout<<i+1<<endl;
		}
	}
	P("nice");
	return 0;
}

Subtask #1
0 / 27.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 Incorrect 5 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 21116 KB Output is correct
2 Correct 182 ms 27384 KB Output is correct
3 Incorrect 177 ms 26232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 21116 KB Output is correct
2 Correct 182 ms 27384 KB Output is correct
3 Incorrect 177 ms 26232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 26.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 Incorrect 5 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -