oj.uz

답안 #535708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535708 2022-03-11T01:54:35 Z Stro256 Genetics (BOI18_genetics) C++14
100 / 100
 162 ms 82916 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define rep(i,a,b) FOR(i,a,b)
#define REP(a) F0R(_,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rsz resize
#define pb push_back
#define f first
#define s second
#define pf push_front
#define ft front()
#define bk back()
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define tcT template<class T
#define tcTU tcT, class U
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int,int>;
using vpi = vector<pi>;
using str = string;
using vs = vector<str>;
using db = long double;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
tcTU> using PR = pair<T,U>;
tcT, int SZ> using AR = array<T, SZ>;

const int MOD = 1e9+7;
const ll INF = 1e18;
const int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1};

constexpr int bits(int x) { return x == 0 ? 0 : 31 - __builtin_clz(x); }
constexpr bool onbit(int msk, int i) { return msk>>i&1; }
constexpr ll p2(int x) { return 1LL<<x; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int lg2(int x) { return x == 0 ? 0 : 31 - __builtin_clz(x); }; //int only

tcT> bool ckmin(T&a, const T&b) { return b < a ? a = b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) { return b > a ? a = b,1 : 0; }

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); }
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); }

tcTU> T fstTrue(T lo, T hi, U f) {
    hi++; assert(lo <= hi);
    while (lo < hi) {
        T mid = lo+(hi-lo)/2;
        f(mid) ? hi = mid : lo = mid+1;
    }
    return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
    lo--; assert(lo <= hi);
    while (lo < hi) {
        T mid = lo+(hi-lo+1)/2;
        f(mid) ? lo = mid : hi = mid-1;
    }
    return lo;
}

tcT> void remDup(V<T> &v) {
    sort(all(v)); v.erase(unique(all(v)), end(v)); }
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

void setPrec() { cout << fixed << setprecision(16); }
void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    setPrec();
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

const int MX = 4105;
bitset<MX> can;
int N, M, K;
int A[MX][MX];
unsigned w[MX];
unsigned long long cnt[MX][4];

void solve() {
    srand(time(nullptr));
    can.set();
    cin>>N>>M>>K;
    F0R(i,N) {
        str s; cin>>s;
        F0R(j,M) A[i][j] = (int(s[j])>>1)&3;
    }
    int cansz = N;
    while(cansz>1) {
        unsigned long long tot=0;
        F0R(i,N) {
            w[i] = rand();
            tot += w[i];
        }
        F0R(i,M) F0R(j,4) cnt[i][j] = 0;
        F0R(i,N) F0R(j,M) cnt[j][A[i][j]]+=w[i];
        F0R(i,N) if(can[i]) {
            unsigned long long tmp = 0;
            F0R(j,M) tmp += tot - cnt[j][A[i][j]];
            unsigned long long st = (tot-w[i])*K;
            if(tmp != st) {
                cansz--;
                can[i] = false;
            }
        }
    }
    int ans = -1;
    F0R(i,N) if(can[i]) ans = i;
    cout << ans+1 << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

genetics.cpp: In function 'void setIO(std::string)':
genetics.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:96:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 728 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 0 ms 336 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 19292 KB Output is correct
2 Correct 29 ms 23472 KB Output is correct
3 Correct 28 ms 22348 KB Output is correct
4 Correct 8 ms 8216 KB Output is correct
5 Correct 29 ms 23384 KB Output is correct
6 Correct 32 ms 23492 KB Output is correct
7 Correct 14 ms 10196 KB Output is correct
8 Correct 13 ms 10248 KB Output is correct
9 Correct 27 ms 21976 KB Output is correct
10 Correct 27 ms 21884 KB Output is correct
11 Correct 23 ms 19260 KB Output is correct
12 Correct 26 ms 19340 KB Output is correct
13 Correct 27 ms 19404 KB Output is correct
14 Correct 22 ms 16596 KB Output is correct
15 Correct 20 ms 16852 KB Output is correct
16 Correct 20 ms 17284 KB Output is correct
17 Correct 31 ms 22528 KB Output is correct
18 Correct 30 ms 22316 KB Output is correct
19 Correct 30 ms 22548 KB Output is correct
20 Correct 28 ms 22120 KB Output is correct
21 Correct 27 ms 22400 KB Output is correct
22 Correct 28 ms 22200 KB Output is correct
23 Correct 29 ms 22512 KB Output is correct
24 Correct 30 ms 22288 KB Output is correct
25 Correct 28 ms 22164 KB Output is correct
26 Correct 27 ms 22364 KB Output is correct
27 Correct 29 ms 22376 KB Output is correct
28 Correct 29 ms 22244 KB Output is correct
29 Correct 30 ms 22532 KB Output is correct
30 Correct 32 ms 23460 KB Output is correct
31 Correct 31 ms 23448 KB Output is correct
32 Correct 29 ms 23472 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 728 KB Output is correct
35 Correct 0 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 19292 KB Output is correct
2 Correct 29 ms 23472 KB Output is correct
3 Correct 28 ms 22348 KB Output is correct
4 Correct 8 ms 8216 KB Output is correct
5 Correct 29 ms 23384 KB Output is correct
6 Correct 32 ms 23492 KB Output is correct
7 Correct 14 ms 10196 KB Output is correct
8 Correct 13 ms 10248 KB Output is correct
9 Correct 27 ms 21976 KB Output is correct
10 Correct 27 ms 21884 KB Output is correct
11 Correct 23 ms 19260 KB Output is correct
12 Correct 26 ms 19340 KB Output is correct
13 Correct 27 ms 19404 KB Output is correct
14 Correct 22 ms 16596 KB Output is correct
15 Correct 20 ms 16852 KB Output is correct
16 Correct 20 ms 17284 KB Output is correct
17 Correct 31 ms 22528 KB Output is correct
18 Correct 30 ms 22316 KB Output is correct
19 Correct 30 ms 22548 KB Output is correct
20 Correct 28 ms 22120 KB Output is correct
21 Correct 27 ms 22400 KB Output is correct
22 Correct 28 ms 22200 KB Output is correct
23 Correct 29 ms 22512 KB Output is correct
24 Correct 30 ms 22288 KB Output is correct
25 Correct 28 ms 22164 KB Output is correct
26 Correct 27 ms 22364 KB Output is correct
27 Correct 29 ms 22376 KB Output is correct
28 Correct 29 ms 22244 KB Output is correct
29 Correct 30 ms 22532 KB Output is correct
30 Correct 32 ms 23460 KB Output is correct
31 Correct 31 ms 23448 KB Output is correct
32 Correct 29 ms 23472 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 728 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 124 ms 72432 KB Output is correct
37 Correct 127 ms 82916 KB Output is correct
38 Correct 129 ms 80832 KB Output is correct
39 Correct 61 ms 43496 KB Output is correct
40 Correct 128 ms 82736 KB Output is correct
41 Correct 70 ms 41596 KB Output is correct
42 Correct 71 ms 41596 KB Output is correct
43 Correct 96 ms 67604 KB Output is correct
44 Correct 130 ms 82764 KB Output is correct
45 Correct 141 ms 82668 KB Output is correct
46 Correct 129 ms 82648 KB Output is correct
47 Correct 117 ms 72448 KB Output is correct
48 Correct 126 ms 72484 KB Output is correct
49 Correct 97 ms 62180 KB Output is correct
50 Correct 102 ms 62324 KB Output is correct
51 Correct 134 ms 69908 KB Output is correct
52 Correct 151 ms 80784 KB Output is correct
53 Correct 162 ms 80672 KB Output is correct
54 Correct 154 ms 80328 KB Output is correct
55 Correct 137 ms 80392 KB Output is correct
56 Correct 147 ms 80432 KB Output is correct
57 Correct 128 ms 80952 KB Output is correct
58 Correct 143 ms 81056 KB Output is correct
59 Correct 132 ms 80540 KB Output is correct
60 Correct 131 ms 81036 KB Output is correct
61 Correct 139 ms 80516 KB Output is correct
62 Correct 137 ms 80192 KB Output is correct
63 Correct 136 ms 80908 KB Output is correct
64 Correct 144 ms 80856 KB Output is correct
65 Correct 130 ms 80604 KB Output is correct
66 Correct 142 ms 80688 KB Output is correct
67 Correct 141 ms 81076 KB Output is correct
68 Correct 136 ms 80952 KB Output is correct
69 Correct 141 ms 80548 KB Output is correct
70 Correct 131 ms 80844 KB Output is correct
71 Correct 139 ms 80456 KB Output is correct
72 Correct 135 ms 81144 KB Output is correct
73 Correct 137 ms 80604 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 1 ms 724 KB Output is correct
76 Correct 1 ms 340 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 728 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 23 ms 19292 KB Output is correct
19 Correct 29 ms 23472 KB Output is correct
20 Correct 28 ms 22348 KB Output is correct
21 Correct 8 ms 8216 KB Output is correct
22 Correct 29 ms 23384 KB Output is correct
23 Correct 32 ms 23492 KB Output is correct
24 Correct 14 ms 10196 KB Output is correct
25 Correct 13 ms 10248 KB Output is correct
26 Correct 27 ms 21976 KB Output is correct
27 Correct 27 ms 21884 KB Output is correct
28 Correct 23 ms 19260 KB Output is correct
29 Correct 26 ms 19340 KB Output is correct
30 Correct 27 ms 19404 KB Output is correct
31 Correct 22 ms 16596 KB Output is correct
32 Correct 20 ms 16852 KB Output is correct
33 Correct 20 ms 17284 KB Output is correct
34 Correct 31 ms 22528 KB Output is correct
35 Correct 30 ms 22316 KB Output is correct
36 Correct 30 ms 22548 KB Output is correct
37 Correct 28 ms 22120 KB Output is correct
38 Correct 27 ms 22400 KB Output is correct
39 Correct 28 ms 22200 KB Output is correct
40 Correct 29 ms 22512 KB Output is correct
41 Correct 30 ms 22288 KB Output is correct
42 Correct 28 ms 22164 KB Output is correct
43 Correct 27 ms 22364 KB Output is correct
44 Correct 29 ms 22376 KB Output is correct
45 Correct 29 ms 22244 KB Output is correct
46 Correct 30 ms 22532 KB Output is correct
47 Correct 32 ms 23460 KB Output is correct
48 Correct 31 ms 23448 KB Output is correct
49 Correct 29 ms 23472 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 728 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 124 ms 72432 KB Output is correct
54 Correct 127 ms 82916 KB Output is correct
55 Correct 129 ms 80832 KB Output is correct
56 Correct 61 ms 43496 KB Output is correct
57 Correct 128 ms 82736 KB Output is correct
58 Correct 70 ms 41596 KB Output is correct
59 Correct 71 ms 41596 KB Output is correct
60 Correct 96 ms 67604 KB Output is correct
61 Correct 130 ms 82764 KB Output is correct
62 Correct 141 ms 82668 KB Output is correct
63 Correct 129 ms 82648 KB Output is correct
64 Correct 117 ms 72448 KB Output is correct
65 Correct 126 ms 72484 KB Output is correct
66 Correct 97 ms 62180 KB Output is correct
67 Correct 102 ms 62324 KB Output is correct
68 Correct 134 ms 69908 KB Output is correct
69 Correct 151 ms 80784 KB Output is correct
70 Correct 162 ms 80672 KB Output is correct
71 Correct 154 ms 80328 KB Output is correct
72 Correct 137 ms 80392 KB Output is correct
73 Correct 147 ms 80432 KB Output is correct
74 Correct 128 ms 80952 KB Output is correct
75 Correct 143 ms 81056 KB Output is correct
76 Correct 132 ms 80540 KB Output is correct
77 Correct 131 ms 81036 KB Output is correct
78 Correct 139 ms 80516 KB Output is correct
79 Correct 137 ms 80192 KB Output is correct
80 Correct 136 ms 80908 KB Output is correct
81 Correct 144 ms 80856 KB Output is correct
82 Correct 130 ms 80604 KB Output is correct
83 Correct 142 ms 80688 KB Output is correct
84 Correct 141 ms 81076 KB Output is correct
85 Correct 136 ms 80952 KB Output is correct
86 Correct 141 ms 80548 KB Output is correct
87 Correct 131 ms 80844 KB Output is correct
88 Correct 139 ms 80456 KB Output is correct
89 Correct 135 ms 81144 KB Output is correct
90 Correct 137 ms 80604 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 1 ms 724 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 127 ms 78360 KB Output is correct
95 Correct 146 ms 82820 KB Output is correct
96 Correct 141 ms 81536 KB Output is correct
97 Correct 74 ms 44352 KB Output is correct
98 Correct 58 ms 43512 KB Output is correct
99 Correct 154 ms 82784 KB Output is correct
100 Correct 66 ms 41632 KB Output is correct
101 Correct 67 ms 41568 KB Output is correct
102 Correct 105 ms 67724 KB Output is correct
103 Correct 146 ms 82740 KB Output is correct
104 Correct 131 ms 82672 KB Output is correct
105 Correct 143 ms 82700 KB Output is correct
106 Correct 125 ms 78584 KB Output is correct
107 Correct 117 ms 72504 KB Output is correct
108 Correct 110 ms 62192 KB Output is correct
109 Correct 119 ms 71412 KB Output is correct
110 Correct 120 ms 69588 KB Output is correct
111 Correct 140 ms 82716 KB Output is correct
112 Correct 135 ms 81696 KB Output is correct
113 Correct 145 ms 80440 KB Output is correct
114 Correct 130 ms 80432 KB Output is correct
115 Correct 153 ms 80432 KB Output is correct
116 Correct 133 ms 81680 KB Output is correct
117 Correct 149 ms 81936 KB Output is correct
118 Correct 133 ms 81740 KB Output is correct
119 Correct 138 ms 81388 KB Output is correct
120 Correct 134 ms 81748 KB Output is correct
121 Correct 116 ms 72472 KB Output is correct
122 Correct 150 ms 82768 KB Output is correct
123 Correct 134 ms 80824 KB Output is correct
124 Correct 1 ms 332 KB Output is correct
125 Correct 1 ms 724 KB Output is correct
126 Correct 0 ms 340 KB Output is correct