oj.uz

Submission #887689

# Submission time Handle Problem Language Result Execution time Memory
887689 2023-12-15T03:00:07 Z nnhzzz Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 68728 KB 

#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:94:44: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   94 |                 if((f[idx[l]]^f[i]).count()!=k){
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp: In function 'int main()':
genetics.cpp:159:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  159 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
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".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:164:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  164 |         freopen(task1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
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".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 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 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 2 ms 4444 KB Output is correct
13 Correct 1 ms 4504 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 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 309 ms 27196 KB Output is correct
2 Correct 399 ms 33352 KB Output is correct
3 Correct 361 ms 31216 KB Output is correct
4 Correct 132 ms 23092 KB Output is correct
5 Correct 167 ms 33352 KB Output is correct
6 Correct 121 ms 33260 KB Output is correct
7 Correct 58 ms 16928 KB Output is correct
8 Correct 79 ms 16932 KB Output is correct
9 Correct 77 ms 31204 KB Output is correct
10 Correct 306 ms 31196 KB Output is correct
11 Correct 83 ms 27196 KB Output is correct
12 Correct 74 ms 27124 KB Output is correct
13 Correct 166 ms 27200 KB Output is correct
14 Correct 70 ms 24920 KB Output is correct
15 Correct 244 ms 25136 KB Output is correct
16 Correct 200 ms 27360 KB Output is correct
17 Correct 431 ms 31300 KB Output is correct
18 Correct 541 ms 31300 KB Output is correct
19 Correct 415 ms 31300 KB Output is correct
20 Correct 480 ms 31056 KB Output is correct
21 Correct 309 ms 31312 KB Output is correct
22 Correct 134 ms 31216 KB Output is correct
23 Correct 501 ms 31196 KB Output is correct
24 Correct 67 ms 31060 KB Output is correct
25 Correct 167 ms 31296 KB Output is correct
26 Correct 351 ms 31200 KB Output is correct
27 Correct 208 ms 31300 KB Output is correct
28 Correct 301 ms 31056 KB Output is correct
29 Correct 462 ms 31296 KB Output is correct
30 Correct 60 ms 33264 KB Output is correct
31 Correct 60 ms 33236 KB Output is correct
32 Correct 70 ms 33104 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
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 27196 KB Output is correct
2 Correct 399 ms 33352 KB Output is correct
3 Correct 361 ms 31216 KB Output is correct
4 Correct 132 ms 23092 KB Output is correct
5 Correct 167 ms 33352 KB Output is correct
6 Correct 121 ms 33260 KB Output is correct
7 Correct 58 ms 16928 KB Output is correct
8 Correct 79 ms 16932 KB Output is correct
9 Correct 77 ms 31204 KB Output is correct
10 Correct 306 ms 31196 KB Output is correct
11 Correct 83 ms 27196 KB Output is correct
12 Correct 74 ms 27124 KB Output is correct
13 Correct 166 ms 27200 KB Output is correct
14 Correct 70 ms 24920 KB Output is correct
15 Correct 244 ms 25136 KB Output is correct
16 Correct 200 ms 27360 KB Output is correct
17 Correct 431 ms 31300 KB Output is correct
18 Correct 541 ms 31300 KB Output is correct
19 Correct 415 ms 31300 KB Output is correct
20 Correct 480 ms 31056 KB Output is correct
21 Correct 309 ms 31312 KB Output is correct
22 Correct 134 ms 31216 KB Output is correct
23 Correct 501 ms 31196 KB Output is correct
24 Correct 67 ms 31060 KB Output is correct
25 Correct 167 ms 31296 KB Output is correct
26 Correct 351 ms 31200 KB Output is correct
27 Correct 208 ms 31300 KB Output is correct
28 Correct 301 ms 31056 KB Output is correct
29 Correct 462 ms 31296 KB Output is correct
30 Correct 60 ms 33264 KB Output is correct
31 Correct 60 ms 33236 KB Output is correct
32 Correct 70 ms 33104 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 826 ms 62092 KB Output is correct
37 Correct 1672 ms 68728 KB Output is correct
38 Execution timed out 2029 ms 68144 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 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 2 ms 4444 KB Output is correct
13 Correct 1 ms 4504 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 309 ms 27196 KB Output is correct
19 Correct 399 ms 33352 KB Output is correct
20 Correct 361 ms 31216 KB Output is correct
21 Correct 132 ms 23092 KB Output is correct
22 Correct 167 ms 33352 KB Output is correct
23 Correct 121 ms 33260 KB Output is correct
24 Correct 58 ms 16928 KB Output is correct
25 Correct 79 ms 16932 KB Output is correct
26 Correct 77 ms 31204 KB Output is correct
27 Correct 306 ms 31196 KB Output is correct
28 Correct 83 ms 27196 KB Output is correct
29 Correct 74 ms 27124 KB Output is correct
30 Correct 166 ms 27200 KB Output is correct
31 Correct 70 ms 24920 KB Output is correct
32 Correct 244 ms 25136 KB Output is correct
33 Correct 200 ms 27360 KB Output is correct
34 Correct 431 ms 31300 KB Output is correct
35 Correct 541 ms 31300 KB Output is correct
36 Correct 415 ms 31300 KB Output is correct
37 Correct 480 ms 31056 KB Output is correct
38 Correct 309 ms 31312 KB Output is correct
39 Correct 134 ms 31216 KB Output is correct
40 Correct 501 ms 31196 KB Output is correct
41 Correct 67 ms 31060 KB Output is correct
42 Correct 167 ms 31296 KB Output is correct
43 Correct 351 ms 31200 KB Output is correct
44 Correct 208 ms 31300 KB Output is correct
45 Correct 301 ms 31056 KB Output is correct
46 Correct 462 ms 31296 KB Output is correct
47 Correct 60 ms 33264 KB Output is correct
48 Correct 60 ms 33236 KB Output is correct
49 Correct 70 ms 33104 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 826 ms 62092 KB Output is correct
54 Correct 1672 ms 68728 KB Output is correct
55 Execution timed out 2029 ms 68144 KB Time limit exceeded
56 Halted 0 ms 0 KB -