oj.uz

Submission #887691

# Submission time Handle Problem Language Result Execution time Memory
887691 2023-12-15T03:00:43 Z nnhzzz Genetics (BOI18_genetics) C++14
74 / 100
 996 ms 68880 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

#include<bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i = (a); i<=(b); ++i)
#define REPD(i,a,b) for(int i = (a); i>=(b); --i)
#define REPDIS(i,a,b,c) for(int i = (a); i<=(b); i += c)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define MASK(x) (1LL<<(x))
#define BIT(x,i) (((x)>>(i))&1LL)
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define fi first
#define se second
#define gcd __gcd
#define ld long double
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define endl "\n"
//#define int ll

//-------------------------------------------------------------------------------------------------------//
int readInt(){
    char c;
    do{
        c = getchar();
    }while(c!='-' && !isdigit(c));
    bool neg = (c=='-');
    int res = neg?0:c-'0';
    while(isdigit(c=getchar())) res = (res<<3)+(res<<1)+(c-'0');
    return neg?-res:res;
}
//-------------------------------------------------------------------------------------------------------//
template<typename T> bool mini(T &a, const T &b){if(a>b){a=b;return true;}return false;}
template<typename T> bool maxi(T &a, const T &b){if(a<b){a=b;return true;}return false;}
//-------------------------------------------------------------------------------------------------------//
const int MAXN = 4e3+123;
const int MOD = 1e9+7;
const int INF = 1e9;
const int LOG = 16;
const ll LINF = 5e17;
const ld EPS = 1e-9;
const ld PI = acos(-1);
//-------------------------------------------------------------------------------------------------------//

int a[MAXN][MAXN];
int n,m,k;

namespace sub1{

    void solve(){
        REP(l,1,n){
            int ok = 1;
            REP(i,1,n){
                if(i==l) continue;
                int cnt = 0;
                REP(j,1,m) if(a[l][j]!=a[i][j]) ++cnt;
                if(cnt!=k){
                    ok = 0;
                    break;
                }
            }
            if(ok){
                cout << l;
                return ;
            }
        }
    }
}

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

namespace sub2{
    bitset<MAXN> f[MAXN];
    int idx[MAXN];

    void solve(){
        srand(time(0));
        REP(i,1,n) idx[i] = i;
        shuffle(idx+1,idx+n+1,rd);
        REP(i,1,n) REP(j,1,m) f[i][j] = a[i][j]-1;
        REP(l,1,n){
            int ok = 1;
            REP(i,1,n){
                if(i==idx[l]) continue;
                if((f[idx[l]]^f[i]).count()!=k){
                    ok = 0;
                    break;
                }
            }
            if(ok){
                cout << idx[l];
                return ;
            }
        }
    }
}

namespace sub4{
    int s[MAXN][5],rnd[MAXN];
    int tot = 0;

    void solve(){
        srand(time(0));
        REP(i,1,n){
            rnd[i] = rd();
            tot += rnd[i];
            REP(j,1,m) s[j][a[i][j]] += rnd[i];
        }
        REP(i,1,n){
            int hsh = 0;
            REP(j,1,m) hsh += tot-s[j][a[i][j]];
            if(hsh==1LL*k*(tot-rnd[i])){
                cout << i;
                return ;
            }
        }
    }
}

void solve(){
    cin >> n >> m >> k;
    int s2 = 1;
    REP(i,1,n){
        REP(j,1,m){
            char ch; cin >> ch;
            if(ch=='A') a[i][j] = 1;
            if(ch=='C') a[i][j] = 2;
            if(ch=='G') a[i][j] = 3;
            if(ch=='T') a[i][j] = 4;
            if(a[i][j]>2) s2 = 0;
        }
    }
    // sub4::solve(); return ;
    if(n<=100){
        sub1::solve();
        return ;
    }
    if(s2){
        sub2::solve();
        return ;
    }
    sub4::solve();
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define task "test"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    #define task1 "nothing"
    if(fopen(task1".inp","r")){
        freopen(task1".inp","r",stdin);
        freopen(task1".out","w",stdout);
    }
    int test = 1;
    while(test--){
        solve();
        cout << endl;
    }
    return 0;
}

Compilation message

genetics.cpp: In function 'void sub2::solve()':
genetics.cpp:95:44: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |                 if((f[idx[l]]^f[i]).count()!=k){
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp: In function 'int main()':
genetics.cpp:160:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  160 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:161:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  161 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:165:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |         freopen(task1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:166:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |         freopen(task1".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 26960 KB Output is correct
2 Correct 157 ms 33108 KB Output is correct
3 Correct 247 ms 31288 KB Output is correct
4 Correct 26 ms 22876 KB Output is correct
5 Correct 99 ms 33240 KB Output is correct
6 Correct 156 ms 33340 KB Output is correct
7 Correct 32 ms 16732 KB Output is correct
8 Correct 43 ms 16720 KB Output is correct
9 Correct 68 ms 31292 KB Output is correct
10 Correct 80 ms 31208 KB Output is correct
11 Correct 74 ms 26964 KB Output is correct
12 Correct 79 ms 26964 KB Output is correct
13 Correct 105 ms 26964 KB Output is correct
14 Correct 91 ms 24916 KB Output is correct
15 Correct 79 ms 24924 KB Output is correct
16 Correct 56 ms 27132 KB Output is correct
17 Correct 77 ms 31292 KB Output is correct
18 Correct 197 ms 31056 KB Output is correct
19 Correct 87 ms 31056 KB Output is correct
20 Correct 161 ms 31292 KB Output is correct
21 Correct 98 ms 31296 KB Output is correct
22 Correct 185 ms 31180 KB Output is correct
23 Correct 105 ms 31060 KB Output is correct
24 Correct 114 ms 31060 KB Output is correct
25 Correct 106 ms 31056 KB Output is correct
26 Correct 211 ms 31060 KB Output is correct
27 Correct 79 ms 31060 KB Output is correct
28 Correct 101 ms 31216 KB Output is correct
29 Correct 159 ms 31056 KB Output is correct
30 Correct 58 ms 33104 KB Output is correct
31 Correct 60 ms 33112 KB Output is correct
32 Correct 72 ms 33108 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 26960 KB Output is correct
2 Correct 157 ms 33108 KB Output is correct
3 Correct 247 ms 31288 KB Output is correct
4 Correct 26 ms 22876 KB Output is correct
5 Correct 99 ms 33240 KB Output is correct
6 Correct 156 ms 33340 KB Output is correct
7 Correct 32 ms 16732 KB Output is correct
8 Correct 43 ms 16720 KB Output is correct
9 Correct 68 ms 31292 KB Output is correct
10 Correct 80 ms 31208 KB Output is correct
11 Correct 74 ms 26964 KB Output is correct
12 Correct 79 ms 26964 KB Output is correct
13 Correct 105 ms 26964 KB Output is correct
14 Correct 91 ms 24916 KB Output is correct
15 Correct 79 ms 24924 KB Output is correct
16 Correct 56 ms 27132 KB Output is correct
17 Correct 77 ms 31292 KB Output is correct
18 Correct 197 ms 31056 KB Output is correct
19 Correct 87 ms 31056 KB Output is correct
20 Correct 161 ms 31292 KB Output is correct
21 Correct 98 ms 31296 KB Output is correct
22 Correct 185 ms 31180 KB Output is correct
23 Correct 105 ms 31060 KB Output is correct
24 Correct 114 ms 31060 KB Output is correct
25 Correct 106 ms 31056 KB Output is correct
26 Correct 211 ms 31060 KB Output is correct
27 Correct 79 ms 31060 KB Output is correct
28 Correct 101 ms 31216 KB Output is correct
29 Correct 159 ms 31056 KB Output is correct
30 Correct 58 ms 33104 KB Output is correct
31 Correct 60 ms 33112 KB Output is correct
32 Correct 72 ms 33108 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 960 ms 62708 KB Output is correct
37 Correct 479 ms 68764 KB Output is correct
38 Correct 928 ms 68432 KB Output is correct
39 Correct 360 ms 60244 KB Output is correct
40 Correct 650 ms 68656 KB Output is correct
41 Correct 194 ms 37448 KB Output is correct
42 Correct 203 ms 37204 KB Output is correct
43 Correct 354 ms 59880 KB Output is correct
44 Correct 496 ms 68880 KB Output is correct
45 Correct 488 ms 68688 KB Output is correct
46 Correct 996 ms 68860 KB Output is correct
47 Correct 528 ms 62076 KB Output is correct
48 Correct 408 ms 61920 KB Output is correct
49 Correct 309 ms 53844 KB Output is correct
50 Correct 337 ms 53720 KB Output is correct
51 Correct 347 ms 59988 KB Output is correct
52 Correct 518 ms 68232 KB Output is correct
53 Correct 403 ms 68440 KB Output is correct
54 Correct 287 ms 68064 KB Output is correct
55 Correct 300 ms 68232 KB Output is correct
56 Correct 346 ms 68080 KB Output is correct
57 Correct 367 ms 68180 KB Output is correct
58 Correct 459 ms 68140 KB Output is correct
59 Correct 707 ms 68232 KB Output is correct
60 Correct 692 ms 68084 KB Output is correct
61 Correct 486 ms 68176 KB Output is correct
62 Correct 420 ms 68436 KB Output is correct
63 Correct 649 ms 68176 KB Output is correct
64 Correct 722 ms 68232 KB Output is correct
65 Correct 581 ms 68180 KB Output is correct
66 Correct 394 ms 68360 KB Output is correct
67 Correct 467 ms 68056 KB Output is correct
68 Correct 701 ms 68384 KB Output is correct
69 Correct 619 ms 68432 KB Output is correct
70 Correct 877 ms 68236 KB Output is correct
71 Correct 589 ms 68048 KB Output is correct
72 Correct 702 ms 68172 KB Output is correct
73 Correct 828 ms 68304 KB Output is correct
74 Correct 1 ms 4440 KB Output is correct
75 Correct 1 ms 4444 KB Output is correct
76 Correct 1 ms 4440 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 144 ms 26960 KB Output is correct
19 Correct 157 ms 33108 KB Output is correct
20 Correct 247 ms 31288 KB Output is correct
21 Correct 26 ms 22876 KB Output is correct
22 Correct 99 ms 33240 KB Output is correct
23 Correct 156 ms 33340 KB Output is correct
24 Correct 32 ms 16732 KB Output is correct
25 Correct 43 ms 16720 KB Output is correct
26 Correct 68 ms 31292 KB Output is correct
27 Correct 80 ms 31208 KB Output is correct
28 Correct 74 ms 26964 KB Output is correct
29 Correct 79 ms 26964 KB Output is correct
30 Correct 105 ms 26964 KB Output is correct
31 Correct 91 ms 24916 KB Output is correct
32 Correct 79 ms 24924 KB Output is correct
33 Correct 56 ms 27132 KB Output is correct
34 Correct 77 ms 31292 KB Output is correct
35 Correct 197 ms 31056 KB Output is correct
36 Correct 87 ms 31056 KB Output is correct
37 Correct 161 ms 31292 KB Output is correct
38 Correct 98 ms 31296 KB Output is correct
39 Correct 185 ms 31180 KB Output is correct
40 Correct 105 ms 31060 KB Output is correct
41 Correct 114 ms 31060 KB Output is correct
42 Correct 106 ms 31056 KB Output is correct
43 Correct 211 ms 31060 KB Output is correct
44 Correct 79 ms 31060 KB Output is correct
45 Correct 101 ms 31216 KB Output is correct
46 Correct 159 ms 31056 KB Output is correct
47 Correct 58 ms 33104 KB Output is correct
48 Correct 60 ms 33112 KB Output is correct
49 Correct 72 ms 33108 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 960 ms 62708 KB Output is correct
54 Correct 479 ms 68764 KB Output is correct
55 Correct 928 ms 68432 KB Output is correct
56 Correct 360 ms 60244 KB Output is correct
57 Correct 650 ms 68656 KB Output is correct
58 Correct 194 ms 37448 KB Output is correct
59 Correct 203 ms 37204 KB Output is correct
60 Correct 354 ms 59880 KB Output is correct
61 Correct 496 ms 68880 KB Output is correct
62 Correct 488 ms 68688 KB Output is correct
63 Correct 996 ms 68860 KB Output is correct
64 Correct 528 ms 62076 KB Output is correct
65 Correct 408 ms 61920 KB Output is correct
66 Correct 309 ms 53844 KB Output is correct
67 Correct 337 ms 53720 KB Output is correct
68 Correct 347 ms 59988 KB Output is correct
69 Correct 518 ms 68232 KB Output is correct
70 Correct 403 ms 68440 KB Output is correct
71 Correct 287 ms 68064 KB Output is correct
72 Correct 300 ms 68232 KB Output is correct
73 Correct 346 ms 68080 KB Output is correct
74 Correct 367 ms 68180 KB Output is correct
75 Correct 459 ms 68140 KB Output is correct
76 Correct 707 ms 68232 KB Output is correct
77 Correct 692 ms 68084 KB Output is correct
78 Correct 486 ms 68176 KB Output is correct
79 Correct 420 ms 68436 KB Output is correct
80 Correct 649 ms 68176 KB Output is correct
81 Correct 722 ms 68232 KB Output is correct
82 Correct 581 ms 68180 KB Output is correct
83 Correct 394 ms 68360 KB Output is correct
84 Correct 467 ms 68056 KB Output is correct
85 Correct 701 ms 68384 KB Output is correct
86 Correct 619 ms 68432 KB Output is correct
87 Correct 877 ms 68236 KB Output is correct
88 Correct 589 ms 68048 KB Output is correct
89 Correct 702 ms 68172 KB Output is correct
90 Correct 828 ms 68304 KB Output is correct
91 Correct 1 ms 4440 KB Output is correct
92 Correct 1 ms 4444 KB Output is correct
93 Correct 1 ms 4440 KB Output is correct
94 Incorrect 337 ms 66008 KB Output isn't correct
95 Halted 0 ms 0 KB -