oj.uz

Submission #1102318

# Submission time Handle Problem Language Result Execution time Memory
1102318 2024-10-18T02:16:20 Z huyngodzz Topical (NOI23_topical) C++14
61 / 100
 1000 ms 143832 KB 
    ///huynhocute123///
#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define pb push_back
#define pi M_PI
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define REP(i, a, b) for(int i = b; i >= a; --i)
#define ALL(v) v.begin(),v.end()
#define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
#define out(name) if(fopen(name, "w")) freopen(name, "w", stdout);
//random_device rd;
//mt19937 rng(rd());
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("popcnt")
//#define int long long
const int maxN = 1e6 + 9 ;
const int  modd = 1e9 + 7;
const int base = 2309;
const int MAX = 1e9+9;
void minimize(int &u, int v){
    if(v < u) u = v;
}
void maximize(int &u, int v){
    if(v > u) u = v;
}
int n, k, t, m, res;
vector<vector<int>> a, b;
pii A[maxN];
int l, r;
bool vis[maxN];
vector<int> e[maxN];
long long sum[maxN];
void sub1(){
    for(int i= 1;i <= n ;i++){
        for(int j= 1;j <= m ;j++)cin >> a[i][j];
    }
    for(int i =1;i <= n ;i++){
        for(int j = 1;j <=m ;j++)cin >> b[i][j];
    }
    int res = 1;
    for(int j= 1;j <= m ;j++){
        if(a[1][j] != 0)res =0;
    }
    cout << res;
}
void sub2(){
    for(int i= 1;i <= n ;i++){
        for(int j= 1;j <= m ;j++)cin >> a[i][j];
    }
    for(int i =1;i <= n ;i++){
        for(int j = 1;j <=m ;j++)cin >> b[i][j];
    }
    unordered_set<int>st;
    while(res <= n){
            int flag =0;
            for(int i =1 ;i <= n ;i++){
                if(vis[i])continue;
                int ok =1;
                for(int j=1 ; j <=m ;j++){
                    if(a[i][j] > sum[j]){
                        ok= 0;
                        break;
                    }
                }
                if(!ok)continue;
                for(int j=1;j <= m ;j++){
                    sum[j] += b[i][j];
                }
                flag =1;
                vis[i] = 1;
                res++;
            }
            if(flag ==0)break;
    }
    cout << res;
}
void sub3(){
    for(int i =1;i <= n ;i++)cin >> A[i].F;
    for(int i =1;i <= n ;i++)cin >> A[i].S;
    sort(A +1, A +1 + n);
    long long cur =0;
    for(int i=1; i <= n ;i++){
        if(cur >= A[i].F){
            cur+= A[i].S;
            res++;
        }else break;
    }
    cout << res;
}
void solve(){
    cin >>  n >> m;
    a = vector<vector<int>>  (n + 5, vector<int>(m + 5) );
    b= vector<vector<int>>  (n + 5, vector<int>(m + 5) );
    if(n==1){
        sub1();
        return;
    }
    if(m==1){
        sub3();
        return;
    }
    sub2();



}
signed main(){
//    freopen("name.inp","r",stdin);
//    freopen("name.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    inp("task.inp");
    t = 1;
   // cin >> t;
    while( t-- )solve();

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:47: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
      |                                        ~~~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:117:5: note: in expansion of macro 'inp'
  117 |     inp("task.inp");
      |     ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26960 KB Output is correct
2 Correct 7 ms 26976 KB Output is correct
3 Correct 6 ms 27472 KB Output is correct
4 Correct 149 ms 78028 KB Output is correct
5 Correct 120 ms 77836 KB Output is correct
6 Correct 124 ms 78028 KB Output is correct
7 Correct 101 ms 77832 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26960 KB Output is correct
2 Correct 7 ms 27128 KB Output is correct
3 Correct 5 ms 26960 KB Output is correct
4 Correct 4 ms 27020 KB Output is correct
5 Correct 5 ms 27128 KB Output is correct
6 Correct 5 ms 26960 KB Output is correct
7 Correct 7 ms 27216 KB Output is correct
8 Correct 9 ms 27216 KB Output is correct
9 Correct 9 ms 27388 KB Output is correct
10 Correct 9 ms 27216 KB Output is correct
11 Correct 6 ms 27388 KB Output is correct
12 Correct 6 ms 27216 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26960 KB Output is correct
2 Correct 7 ms 26960 KB Output is correct
3 Correct 8 ms 27984 KB Output is correct
4 Correct 33 ms 40016 KB Output is correct
5 Correct 48 ms 40028 KB Output is correct
6 Correct 299 ms 143748 KB Output is correct
7 Correct 298 ms 143776 KB Output is correct
8 Correct 304 ms 143832 KB Output is correct
9 Correct 285 ms 143688 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26960 KB Output is correct
2 Correct 7 ms 26976 KB Output is correct
3 Correct 6 ms 27472 KB Output is correct
4 Correct 149 ms 78028 KB Output is correct
5 Correct 120 ms 77836 KB Output is correct
6 Correct 124 ms 78028 KB Output is correct
7 Correct 101 ms 77832 KB Output is correct
8 Correct 7 ms 26960 KB Output is correct
9 Correct 7 ms 27128 KB Output is correct
10 Correct 5 ms 26960 KB Output is correct
11 Correct 4 ms 27020 KB Output is correct
12 Correct 5 ms 27128 KB Output is correct
13 Correct 5 ms 26960 KB Output is correct
14 Correct 7 ms 27216 KB Output is correct
15 Correct 9 ms 27216 KB Output is correct
16 Correct 9 ms 27388 KB Output is correct
17 Correct 9 ms 27216 KB Output is correct
18 Correct 6 ms 27388 KB Output is correct
19 Correct 6 ms 27216 KB Output is correct
20 Correct 5 ms 26960 KB Output is correct
21 Correct 7 ms 26960 KB Output is correct
22 Correct 8 ms 27984 KB Output is correct
23 Correct 33 ms 40016 KB Output is correct
24 Correct 48 ms 40028 KB Output is correct
25 Correct 299 ms 143748 KB Output is correct
26 Correct 298 ms 143776 KB Output is correct
27 Correct 304 ms 143832 KB Output is correct
28 Correct 285 ms 143688 KB Output is correct
29 Correct 149 ms 35408 KB Output is correct
30 Correct 141 ms 35112 KB Output is correct
31 Execution timed out 1078 ms 47440 KB Time limit exceeded
32 Halted 0 ms 0 KB -