oj.uz

Submission #1102402

# Submission time Handle Problem Language Result Execution time Memory
1102402 2024-10-18T04:07:52 Z LTTrungCHL Topical (NOI23_topical) C++17
12 / 100
 171 ms 86516 KB 
///***LTT***///
/// ->NHAT QUOC GIA<- ///
#include<bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
//#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
using namespace std;
vector <int> lg2;
//void MAKE_LOG_ARR(int n){
//    lg2.resize(n + 3);
//    for (int i = 1;i <= n;++i){
//        lg2[i] = __lg(i);
//    }
//}
const long long oo = 1e9+7;
const int N = 2 * 1e5 + 10;
int n, k;
vector <pair <int ,int>> in[1000004];
vector <vector <int>> a;
vector <long long> cur, cnt;
void solve(){
    cin >> n >> k;
    for (int i = 1;i <= n;++i){
        for (int j = 1;j <= k;++j){
            int v;
            cin >> v;
            in[j].pb({v, i});
        }
    }
    cur.resize(k + 2,0);
    cnt.resize(k + 2,0);
    a.resize(n + 2, vector <int> (k + 2,0));
    for (int i = 1;i <= n;++i){
        for (int j = 1;j <= k;++j){
            cin >> a[i][j];
        }
    }
    for (int i = 1;i <= k;++i){
        sort(in[i].begin(), in[i].end());
        reverse(in[i].begin(), in[i].end());
    }
    int gain = 0;
    while (1){
        bool found = false;
        for (int i = 1;i <= k;++i){
            while (!in[i].empty() and in[i].back().F <= cur[i]){
                ++cnt[in[i].back().S];
                if (cnt[in[i].back().S] == k){
                    found = true;
                    for (int j = 1;j <= k;++j){
                        cur[j] += a[in[i].back().S][j];
                        cur[j] = min(cur[j], oo);
                    }
                    ++gain;
                }
                in[i].pop_back();
            }
        }
        if (!found) break;
    }
    cout << gain;
    return;
}
int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    if (fopen("ltt.inp", "r")){
        freopen("ltt.inp", "r", stdin);
        freopen("ltt.out", "w", stdout);
    }
//    int t;
//    cin >> t;
//    while(t--){
    solve();
//    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen("ltt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:75:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         freopen("ltt.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23888 KB Output is correct
2 Correct 6 ms 23948 KB Output is correct
3 Correct 7 ms 24400 KB Output is correct
4 Correct 163 ms 86392 KB Output is correct
5 Correct 168 ms 86344 KB Output is correct
6 Correct 171 ms 86344 KB Output is correct
7 Correct 142 ms 86516 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23888 KB Output is correct
2 Correct 5 ms 23888 KB Output is correct
3 Correct 5 ms 23888 KB Output is correct
4 Correct 5 ms 23888 KB Output is correct
5 Correct 5 ms 23888 KB Output is correct
6 Incorrect 6 ms 23952 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24144 KB Output is correct
2 Incorrect 5 ms 23888 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23888 KB Output is correct
2 Correct 6 ms 23948 KB Output is correct
3 Correct 7 ms 24400 KB Output is correct
4 Correct 163 ms 86392 KB Output is correct
5 Correct 168 ms 86344 KB Output is correct
6 Correct 171 ms 86344 KB Output is correct
7 Correct 142 ms 86516 KB Output is correct
8 Correct 5 ms 23888 KB Output is correct
9 Correct 5 ms 23888 KB Output is correct
10 Correct 5 ms 23888 KB Output is correct
11 Correct 5 ms 23888 KB Output is correct
12 Correct 5 ms 23888 KB Output is correct
13 Incorrect 6 ms 23952 KB Output isn't correct
14 Halted 0 ms 0 KB -