oj.uz

답안 #887679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887679 2023-12-15T02:37:09 Z nnhzzz Genetics (BOI18_genetics) C++14
74 / 100
 2000 ms 84820 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 ;
            }
        }
    }
}

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;
        }
    }
    if(s2){
        sub2::solve();
        return ;
    }
    sub1::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:96:44: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   96 |                 if((f[idx[l]]^f[i]).count()!=k){
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp: In function 'int main()':
genetics.cpp:134:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:135:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:139:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  139 |         freopen(task1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:140:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  140 |         freopen(task1".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 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 4444 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 4440 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 2 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 27224 KB Output is correct
2 Correct 110 ms 33268 KB Output is correct
3 Correct 78 ms 31316 KB Output is correct
4 Correct 48 ms 23128 KB Output is correct
5 Correct 96 ms 33440 KB Output is correct
6 Correct 161 ms 33360 KB Output is correct
7 Correct 45 ms 14936 KB Output is correct
8 Correct 46 ms 14928 KB Output is correct
9 Correct 69 ms 31340 KB Output is correct
10 Correct 154 ms 31188 KB Output is correct
11 Correct 91 ms 27220 KB Output is correct
12 Correct 97 ms 27372 KB Output is correct
13 Correct 133 ms 27220 KB Output is correct
14 Correct 82 ms 25232 KB Output is correct
15 Correct 110 ms 25228 KB Output is correct
16 Correct 122 ms 27220 KB Output is correct
17 Correct 147 ms 31388 KB Output is correct
18 Correct 215 ms 31312 KB Output is correct
19 Correct 107 ms 31204 KB Output is correct
20 Correct 227 ms 31444 KB Output is correct
21 Correct 214 ms 31316 KB Output is correct
22 Correct 159 ms 31572 KB Output is correct
23 Correct 172 ms 31188 KB Output is correct
24 Correct 92 ms 31224 KB Output is correct
25 Correct 117 ms 31320 KB Output is correct
26 Correct 189 ms 31388 KB Output is correct
27 Correct 113 ms 31312 KB Output is correct
28 Correct 83 ms 31216 KB Output is correct
29 Correct 75 ms 31312 KB Output is correct
30 Correct 59 ms 33364 KB Output is correct
31 Correct 61 ms 33360 KB Output is correct
32 Correct 74 ms 33364 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 27224 KB Output is correct
2 Correct 110 ms 33268 KB Output is correct
3 Correct 78 ms 31316 KB Output is correct
4 Correct 48 ms 23128 KB Output is correct
5 Correct 96 ms 33440 KB Output is correct
6 Correct 161 ms 33360 KB Output is correct
7 Correct 45 ms 14936 KB Output is correct
8 Correct 46 ms 14928 KB Output is correct
9 Correct 69 ms 31340 KB Output is correct
10 Correct 154 ms 31188 KB Output is correct
11 Correct 91 ms 27220 KB Output is correct
12 Correct 97 ms 27372 KB Output is correct
13 Correct 133 ms 27220 KB Output is correct
14 Correct 82 ms 25232 KB Output is correct
15 Correct 110 ms 25228 KB Output is correct
16 Correct 122 ms 27220 KB Output is correct
17 Correct 147 ms 31388 KB Output is correct
18 Correct 215 ms 31312 KB Output is correct
19 Correct 107 ms 31204 KB Output is correct
20 Correct 227 ms 31444 KB Output is correct
21 Correct 214 ms 31316 KB Output is correct
22 Correct 159 ms 31572 KB Output is correct
23 Correct 172 ms 31188 KB Output is correct
24 Correct 92 ms 31224 KB Output is correct
25 Correct 117 ms 31320 KB Output is correct
26 Correct 189 ms 31388 KB Output is correct
27 Correct 113 ms 31312 KB Output is correct
28 Correct 83 ms 31216 KB Output is correct
29 Correct 75 ms 31312 KB Output is correct
30 Correct 59 ms 33364 KB Output is correct
31 Correct 61 ms 33360 KB Output is correct
32 Correct 74 ms 33364 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1018 ms 62288 KB Output is correct
37 Correct 743 ms 68696 KB Output is correct
38 Correct 878 ms 68408 KB Output is correct
39 Correct 448 ms 60124 KB Output is correct
40 Correct 559 ms 68872 KB Output is correct
41 Correct 230 ms 37456 KB Output is correct
42 Correct 233 ms 37348 KB Output is correct
43 Correct 278 ms 59984 KB Output is correct
44 Correct 470 ms 68672 KB Output is correct
45 Correct 444 ms 68672 KB Output is correct
46 Correct 1125 ms 68436 KB Output is correct
47 Correct 780 ms 62168 KB Output is correct
48 Correct 531 ms 62168 KB Output is correct
49 Correct 493 ms 54000 KB Output is correct
50 Correct 735 ms 53960 KB Output is correct
51 Correct 373 ms 60112 KB Output is correct
52 Correct 456 ms 68328 KB Output is correct
53 Correct 359 ms 68180 KB Output is correct
54 Correct 302 ms 83996 KB Output is correct
55 Correct 300 ms 83996 KB Output is correct
56 Correct 352 ms 83996 KB Output is correct
57 Correct 506 ms 84304 KB Output is correct
58 Correct 403 ms 84312 KB Output is correct
59 Correct 865 ms 84308 KB Output is correct
60 Correct 577 ms 84428 KB Output is correct
61 Correct 383 ms 84300 KB Output is correct
62 Correct 400 ms 84160 KB Output is correct
63 Correct 525 ms 84304 KB Output is correct
64 Correct 895 ms 84404 KB Output is correct
65 Correct 688 ms 84172 KB Output is correct
66 Correct 447 ms 84344 KB Output is correct
67 Correct 727 ms 84408 KB Output is correct
68 Correct 617 ms 84392 KB Output is correct
69 Correct 810 ms 84316 KB Output is correct
70 Correct 842 ms 84380 KB Output is correct
71 Correct 826 ms 84560 KB Output is correct
72 Correct 719 ms 84308 KB Output is correct
73 Correct 649 ms 84156 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 4444 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 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 4444 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 4440 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 2 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 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 152 ms 27224 KB Output is correct
19 Correct 110 ms 33268 KB Output is correct
20 Correct 78 ms 31316 KB Output is correct
21 Correct 48 ms 23128 KB Output is correct
22 Correct 96 ms 33440 KB Output is correct
23 Correct 161 ms 33360 KB Output is correct
24 Correct 45 ms 14936 KB Output is correct
25 Correct 46 ms 14928 KB Output is correct
26 Correct 69 ms 31340 KB Output is correct
27 Correct 154 ms 31188 KB Output is correct
28 Correct 91 ms 27220 KB Output is correct
29 Correct 97 ms 27372 KB Output is correct
30 Correct 133 ms 27220 KB Output is correct
31 Correct 82 ms 25232 KB Output is correct
32 Correct 110 ms 25228 KB Output is correct
33 Correct 122 ms 27220 KB Output is correct
34 Correct 147 ms 31388 KB Output is correct
35 Correct 215 ms 31312 KB Output is correct
36 Correct 107 ms 31204 KB Output is correct
37 Correct 227 ms 31444 KB Output is correct
38 Correct 214 ms 31316 KB Output is correct
39 Correct 159 ms 31572 KB Output is correct
40 Correct 172 ms 31188 KB Output is correct
41 Correct 92 ms 31224 KB Output is correct
42 Correct 117 ms 31320 KB Output is correct
43 Correct 189 ms 31388 KB Output is correct
44 Correct 113 ms 31312 KB Output is correct
45 Correct 83 ms 31216 KB Output is correct
46 Correct 75 ms 31312 KB Output is correct
47 Correct 59 ms 33364 KB Output is correct
48 Correct 61 ms 33360 KB Output is correct
49 Correct 74 ms 33364 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 1 ms 4696 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 1018 ms 62288 KB Output is correct
54 Correct 743 ms 68696 KB Output is correct
55 Correct 878 ms 68408 KB Output is correct
56 Correct 448 ms 60124 KB Output is correct
57 Correct 559 ms 68872 KB Output is correct
58 Correct 230 ms 37456 KB Output is correct
59 Correct 233 ms 37348 KB Output is correct
60 Correct 278 ms 59984 KB Output is correct
61 Correct 470 ms 68672 KB Output is correct
62 Correct 444 ms 68672 KB Output is correct
63 Correct 1125 ms 68436 KB Output is correct
64 Correct 780 ms 62168 KB Output is correct
65 Correct 531 ms 62168 KB Output is correct
66 Correct 493 ms 54000 KB Output is correct
67 Correct 735 ms 53960 KB Output is correct
68 Correct 373 ms 60112 KB Output is correct
69 Correct 456 ms 68328 KB Output is correct
70 Correct 359 ms 68180 KB Output is correct
71 Correct 302 ms 83996 KB Output is correct
72 Correct 300 ms 83996 KB Output is correct
73 Correct 352 ms 83996 KB Output is correct
74 Correct 506 ms 84304 KB Output is correct
75 Correct 403 ms 84312 KB Output is correct
76 Correct 865 ms 84308 KB Output is correct
77 Correct 577 ms 84428 KB Output is correct
78 Correct 383 ms 84300 KB Output is correct
79 Correct 400 ms 84160 KB Output is correct
80 Correct 525 ms 84304 KB Output is correct
81 Correct 895 ms 84404 KB Output is correct
82 Correct 688 ms 84172 KB Output is correct
83 Correct 447 ms 84344 KB Output is correct
84 Correct 727 ms 84408 KB Output is correct
85 Correct 617 ms 84392 KB Output is correct
86 Correct 810 ms 84316 KB Output is correct
87 Correct 842 ms 84380 KB Output is correct
88 Correct 826 ms 84560 KB Output is correct
89 Correct 719 ms 84308 KB Output is correct
90 Correct 649 ms 84156 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 4444 KB Output is correct
94 Correct 628 ms 81492 KB Output is correct
95 Execution timed out 2051 ms 84820 KB Time limit exceeded
96 Halted 0 ms 0 KB -