oj.uz

Submission #367433

# Submission time Handle Problem Language Result Execution time Memory
367433 2021-02-17T09:55:22 Z ACmachine Genetics (BOI18_genetics) C++17
100 / 100
 799 ms 36488 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

mt19937_64 rng(time(NULL));   
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, k;
    cin >> n >> m >> k;
    vector<string> s(n);
    cin >> s;
    vi a(200); a['A'] = 0; a['G'] = 1; a['C'] = 2; a['T'] = 3; 
	vector<ll> random(n);
    REP(i, n) random[i] = rng();
    array<ll, 4> nl = {0, 0, 0, 0};
    vector<array<ll, 4>> charsum(m, nl);
    REP(i, m){
        REP(j, n){
            charsum[i][a[s[j][i]]] += random[j];
        }
    }
    ll desired_sum = 0;
    REP(i, n){
        desired_sum += k * random[i];
    }
    vector<bool> possible(n, false);
    REP(i, n){
        ll sum = 0;
        REP(j, m){
            REP(g, 4){
                if(a[s[i][j]] == g) continue;
                sum += charsum[j][g];
            }
        }
        if(sum == desired_sum - k * random[i]) 
            possible[i] = true;
    }
    REP(i, n){
        if(possible[i]){
            cout << i + 1 << "\n";
            return 0;
        }
    }
    return 0;
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5740 KB Output is correct
2 Correct 74 ms 7020 KB Output is correct
3 Correct 72 ms 6764 KB Output is correct
4 Correct 15 ms 1772 KB Output is correct
5 Correct 72 ms 7020 KB Output is correct
6 Correct 72 ms 7020 KB Output is correct
7 Correct 28 ms 3308 KB Output is correct
8 Correct 32 ms 3308 KB Output is correct
9 Correct 62 ms 6508 KB Output is correct
10 Correct 63 ms 6508 KB Output is correct
11 Correct 58 ms 5740 KB Output is correct
12 Correct 58 ms 5868 KB Output is correct
13 Correct 58 ms 5784 KB Output is correct
14 Correct 49 ms 4972 KB Output is correct
15 Correct 46 ms 5100 KB Output is correct
16 Correct 49 ms 5100 KB Output is correct
17 Correct 68 ms 6764 KB Output is correct
18 Correct 68 ms 6800 KB Output is correct
19 Correct 70 ms 6764 KB Output is correct
20 Correct 68 ms 6784 KB Output is correct
21 Correct 71 ms 6836 KB Output is correct
22 Correct 70 ms 6784 KB Output is correct
23 Correct 69 ms 6764 KB Output is correct
24 Correct 70 ms 6764 KB Output is correct
25 Correct 68 ms 6768 KB Output is correct
26 Correct 69 ms 6764 KB Output is correct
27 Correct 68 ms 6764 KB Output is correct
28 Correct 68 ms 6764 KB Output is correct
29 Correct 68 ms 6892 KB Output is correct
30 Correct 73 ms 7132 KB Output is correct
31 Correct 71 ms 7104 KB Output is correct
32 Correct 72 ms 7020 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5740 KB Output is correct
2 Correct 74 ms 7020 KB Output is correct
3 Correct 72 ms 6764 KB Output is correct
4 Correct 15 ms 1772 KB Output is correct
5 Correct 72 ms 7020 KB Output is correct
6 Correct 72 ms 7020 KB Output is correct
7 Correct 28 ms 3308 KB Output is correct
8 Correct 32 ms 3308 KB Output is correct
9 Correct 62 ms 6508 KB Output is correct
10 Correct 63 ms 6508 KB Output is correct
11 Correct 58 ms 5740 KB Output is correct
12 Correct 58 ms 5868 KB Output is correct
13 Correct 58 ms 5784 KB Output is correct
14 Correct 49 ms 4972 KB Output is correct
15 Correct 46 ms 5100 KB Output is correct
16 Correct 49 ms 5100 KB Output is correct
17 Correct 68 ms 6764 KB Output is correct
18 Correct 68 ms 6800 KB Output is correct
19 Correct 70 ms 6764 KB Output is correct
20 Correct 68 ms 6784 KB Output is correct
21 Correct 71 ms 6836 KB Output is correct
22 Correct 70 ms 6784 KB Output is correct
23 Correct 69 ms 6764 KB Output is correct
24 Correct 70 ms 6764 KB Output is correct
25 Correct 68 ms 6768 KB Output is correct
26 Correct 69 ms 6764 KB Output is correct
27 Correct 68 ms 6764 KB Output is correct
28 Correct 68 ms 6764 KB Output is correct
29 Correct 68 ms 6892 KB Output is correct
30 Correct 73 ms 7132 KB Output is correct
31 Correct 71 ms 7104 KB Output is correct
32 Correct 72 ms 7020 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 599 ms 31980 KB Output is correct
37 Correct 692 ms 35820 KB Output is correct
38 Correct 721 ms 35692 KB Output is correct
39 Correct 148 ms 12652 KB Output is correct
40 Correct 669 ms 35848 KB Output is correct
41 Correct 250 ms 18196 KB Output is correct
42 Correct 307 ms 18156 KB Output is correct
43 Correct 362 ms 25472 KB Output is correct
44 Correct 721 ms 36332 KB Output is correct
45 Correct 720 ms 36332 KB Output is correct
46 Correct 689 ms 36332 KB Output is correct
47 Correct 567 ms 32108 KB Output is correct
48 Correct 556 ms 31980 KB Output is correct
49 Correct 407 ms 27244 KB Output is correct
50 Correct 441 ms 27244 KB Output is correct
51 Correct 516 ms 30344 KB Output is correct
52 Correct 670 ms 35436 KB Output is correct
53 Correct 638 ms 35436 KB Output is correct
54 Correct 493 ms 34028 KB Output is correct
55 Correct 475 ms 34028 KB Output is correct
56 Correct 455 ms 34028 KB Output is correct
57 Correct 555 ms 35572 KB Output is correct
58 Correct 629 ms 35572 KB Output is correct
59 Correct 624 ms 35436 KB Output is correct
60 Correct 709 ms 35608 KB Output is correct
61 Correct 723 ms 35436 KB Output is correct
62 Correct 704 ms 35324 KB Output is correct
63 Correct 675 ms 35648 KB Output is correct
64 Correct 717 ms 35564 KB Output is correct
65 Correct 689 ms 35564 KB Output is correct
66 Correct 722 ms 35576 KB Output is correct
67 Correct 704 ms 35588 KB Output is correct
68 Correct 713 ms 35564 KB Output is correct
69 Correct 701 ms 35460 KB Output is correct
70 Correct 732 ms 35692 KB Output is correct
71 Correct 723 ms 35436 KB Output is correct
72 Correct 727 ms 35692 KB Output is correct
73 Correct 676 ms 35436 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 57 ms 5740 KB Output is correct
19 Correct 74 ms 7020 KB Output is correct
20 Correct 72 ms 6764 KB Output is correct
21 Correct 15 ms 1772 KB Output is correct
22 Correct 72 ms 7020 KB Output is correct
23 Correct 72 ms 7020 KB Output is correct
24 Correct 28 ms 3308 KB Output is correct
25 Correct 32 ms 3308 KB Output is correct
26 Correct 62 ms 6508 KB Output is correct
27 Correct 63 ms 6508 KB Output is correct
28 Correct 58 ms 5740 KB Output is correct
29 Correct 58 ms 5868 KB Output is correct
30 Correct 58 ms 5784 KB Output is correct
31 Correct 49 ms 4972 KB Output is correct
32 Correct 46 ms 5100 KB Output is correct
33 Correct 49 ms 5100 KB Output is correct
34 Correct 68 ms 6764 KB Output is correct
35 Correct 68 ms 6800 KB Output is correct
36 Correct 70 ms 6764 KB Output is correct
37 Correct 68 ms 6784 KB Output is correct
38 Correct 71 ms 6836 KB Output is correct
39 Correct 70 ms 6784 KB Output is correct
40 Correct 69 ms 6764 KB Output is correct
41 Correct 70 ms 6764 KB Output is correct
42 Correct 68 ms 6768 KB Output is correct
43 Correct 69 ms 6764 KB Output is correct
44 Correct 68 ms 6764 KB Output is correct
45 Correct 68 ms 6764 KB Output is correct
46 Correct 68 ms 6892 KB Output is correct
47 Correct 73 ms 7132 KB Output is correct
48 Correct 71 ms 7104 KB Output is correct
49 Correct 72 ms 7020 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 599 ms 31980 KB Output is correct
54 Correct 692 ms 35820 KB Output is correct
55 Correct 721 ms 35692 KB Output is correct
56 Correct 148 ms 12652 KB Output is correct
57 Correct 669 ms 35848 KB Output is correct
58 Correct 250 ms 18196 KB Output is correct
59 Correct 307 ms 18156 KB Output is correct
60 Correct 362 ms 25472 KB Output is correct
61 Correct 721 ms 36332 KB Output is correct
62 Correct 720 ms 36332 KB Output is correct
63 Correct 689 ms 36332 KB Output is correct
64 Correct 567 ms 32108 KB Output is correct
65 Correct 556 ms 31980 KB Output is correct
66 Correct 407 ms 27244 KB Output is correct
67 Correct 441 ms 27244 KB Output is correct
68 Correct 516 ms 30344 KB Output is correct
69 Correct 670 ms 35436 KB Output is correct
70 Correct 638 ms 35436 KB Output is correct
71 Correct 493 ms 34028 KB Output is correct
72 Correct 475 ms 34028 KB Output is correct
73 Correct 455 ms 34028 KB Output is correct
74 Correct 555 ms 35572 KB Output is correct
75 Correct 629 ms 35572 KB Output is correct
76 Correct 624 ms 35436 KB Output is correct
77 Correct 709 ms 35608 KB Output is correct
78 Correct 723 ms 35436 KB Output is correct
79 Correct 704 ms 35324 KB Output is correct
80 Correct 675 ms 35648 KB Output is correct
81 Correct 717 ms 35564 KB Output is correct
82 Correct 689 ms 35564 KB Output is correct
83 Correct 722 ms 35576 KB Output is correct
84 Correct 704 ms 35588 KB Output is correct
85 Correct 713 ms 35564 KB Output is correct
86 Correct 701 ms 35460 KB Output is correct
87 Correct 732 ms 35692 KB Output is correct
88 Correct 723 ms 35436 KB Output is correct
89 Correct 727 ms 35692 KB Output is correct
90 Correct 676 ms 35436 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 1 ms 364 KB Output is correct
93 Correct 1 ms 364 KB Output is correct
94 Correct 741 ms 34568 KB Output is correct
95 Correct 691 ms 35948 KB Output is correct
96 Correct 782 ms 35788 KB Output is correct
97 Correct 357 ms 19344 KB Output is correct
98 Correct 162 ms 12652 KB Output is correct
99 Correct 691 ms 35796 KB Output is correct
100 Correct 337 ms 18156 KB Output is correct
101 Correct 339 ms 18156 KB Output is correct
102 Correct 400 ms 25356 KB Output is correct
103 Correct 742 ms 36400 KB Output is correct
104 Correct 783 ms 36444 KB Output is correct
105 Correct 799 ms 36488 KB Output is correct
106 Correct 724 ms 34576 KB Output is correct
107 Correct 628 ms 32112 KB Output is correct
108 Correct 497 ms 27264 KB Output is correct
109 Correct 656 ms 31512 KB Output is correct
110 Correct 490 ms 29504 KB Output is correct
111 Correct 775 ms 36372 KB Output is correct
112 Correct 769 ms 35852 KB Output is correct
113 Correct 525 ms 34016 KB Output is correct
114 Correct 546 ms 34148 KB Output is correct
115 Correct 582 ms 34048 KB Output is correct
116 Correct 771 ms 35904 KB Output is correct
117 Correct 777 ms 36100 KB Output is correct
118 Correct 762 ms 35952 KB Output is correct
119 Correct 771 ms 35836 KB Output is correct
120 Correct 740 ms 35904 KB Output is correct
121 Correct 600 ms 32016 KB Output is correct
122 Correct 692 ms 36104 KB Output is correct
123 Correct 729 ms 35728 KB Output is correct
124 Correct 1 ms 364 KB Output is correct
125 Correct 1 ms 364 KB Output is correct
126 Correct 1 ms 364 KB Output is correct