Submission #1102327

#TimeUsernameProblemLanguageResultExecution timeMemory
1102327modwweTopical (NOI23_topical)C++17
100 / 100
549 ms160172 KiB
#pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC optimize("conserve-stack") #include<bits/stdc++.h> #define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define mask(i) (1<<i) #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while (c < '0' || c > '9') { c = getchar_unlocked(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + c - '0'; c = getchar_unlocked(); } return x; }; void phongbeo(); const int inf = 1e9; const int mod2 = 1e9 + 7; const int mod1 = 998244353; int add(int x,int y) { if(x+y>=mod2) x-=mod2; return x+y; } struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a, b, c, d; }; struct ie { int a, b, c, d, e; }; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center; int i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; ///modwwe phongbeo(); // checktime } vector<vector<int>> a; vector<vector<int>>c; vector<int> b; struct cmp { bool operator()(ib a,ib b) { return a.a>b.a; } }; priority_queue<ib,vector<ib>,cmp>p[1000001]; void phongbeo() { cin>>n>>m; a.resize(n+1,vector<int>(m+1)); c.resize(n+1,vector<int>(m+1)); b.resize(m+1); for(int i=1; i<=n; i++) { for(int j=1; j<=m; j++) cin>>a[i][j]; p[1].push({a[i][1],i}); } for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) cin>>c[i][j]; while(true) { bool de=0; for(int i=1; i<=m; i++) { while(!p[i].empty()&&p[i].top().a<=b[i]) { ib x=p[i].top(); if(i!=m) { p[i+1].push({a[x.b][i+1],x.b}); } else { de=1; s4++; for(int j=1; j<=m; j++) b[j]+=c[x.b][j]; } p[i].pop(); } } if(!de) { cout<<s4; exit(0); } } }

Compilation message (stderr)

Main.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...