QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#446661 | #6389. Topical | sabagoduadze | 12 | 87ms | 54424kb | C++23 | 787b | 2024-06-17 14:51:25 | 2024-06-17 14:51:26 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,k,ans,p,d[N]; bool bl,fx[N];
set <int> s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>k; int a[n+5][k+5],b[n+5][k+5];
for (int i=1; i<=n; i++)
for (int j=1; j<=k; j++){
cin>>a[i][j];
}
for (int i=1; i<=n; i++)
for (int j=1; j<=k; j++){
cin>>b[i][j];
}
while (1){
p=0;
for (int i=1; i<=n; i++){
if (fx[i]) continue; bl=0;
for (int j=1; j<=k; j++){
if (a[i][j]>0) bl=1;
}
if (bl==0){
p++; fx[i]=1;
for (int j=1; j<=k; j++){
d[j]+=b[i][j];
}
}
}
if (p==0) break; ans+=p;
for (int j=1; j<=k; j++){
for (int i=1; i<=n; i++){
a[i][j]-=d[j];
}
d[j]=0;
}
}
cout<<ans;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 12
Accepted
Test #1:
score: 12
Accepted
time: 0ms
memory: 3580kb
input:
1 1 693647287 340782526
output:
0
result:
ok 1 number(s): "0"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1 100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 279985824 991797187 998715443 98505529 106002744 636773096 815089164 196160830 796988849 87975...
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 4040kb
input:
1 10000 841961872 0 0 0 0 0 0 0 0 0 0 0 0 0 831386430 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 205210920 705123207 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 276768098 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 661649446 0 0 0 0 0 0 0 0 0 0 ...
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 87ms
memory: 54348kb
input:
1 1000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 87ms
memory: 54356kb
input:
1 1000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
1
result:
ok 1 number(s): "1"
Test #6:
score: 0
Accepted
time: 81ms
memory: 54424kb
input:
1 1000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
1
result:
ok 1 number(s): "1"
Test #7:
score: 0
Accepted
time: 60ms
memory: 50448kb
input:
1 1000000 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 10...
output:
0
result:
ok 1 number(s): "0"
Subtask #2:
score: 0
Wrong Answer
Test #8:
score: 28
Accepted
time: 0ms
memory: 3592kb
input:
100 1 893339036 896783899 690308537 201770764 262364362 105000893 770698921 744238454 470980016 935046317 642998516 100481910 392307650 116783134 196939768 372329082 346372520 43063564 245523488 389084350 130314590 412588681 987795927 681635353 304582580 472268968 700147283 743357606 792644412 99955...
output:
85
result:
ok 1 number(s): "85"
Test #9:
score: -28
Wrong Answer
time: 2ms
memory: 3736kb
input:
100 100 1000000000 828788913 1000000000 894501902 1000000000 898513761 837197514 865900986 809812226 853486369 848261509 888902562 1000000000 881898651 932777249 907237990 892103882 1000000000 870206141 1000000000 776016734 1000000000 889438568 856689807 887799348 859324346 872070680 879391131 10000...
output:
43
result:
wrong answer 1st numbers differ - expected: '52', found: '43'
Subtask #3:
score: 0
Time Limit Exceeded
Test #15:
score: 21
Accepted
time: 3ms
memory: 4060kb
input:
10000 1 568857328 651788426 751475430 102940442 763289419 468657944 770847628 780257867 16919385 575963868 281824241 291248174 140016533 313529232 302186452 32709864 787073783 1926820 239509174 220454071 34252400 390385721 675239026 245106357 489697460 28435096 825528061 159083009 16370561 223299279...
output:
10000
result:
ok 1 number(s): "10000"
Test #16:
score: 0
Accepted
time: 30ms
memory: 8432kb
input:
100000 1 78763439 671847244 661890823 215179284 804182046 667280820 140277780 822235648 809998506 39559747 459311656 212179350 227573276 606854131 182676019 61302123 281509402 53785090 106827674 911115512 31998233 678388767 75425082 154920343 882021740 976962371 219500493 609794633 780392857 6696241...
output:
68284
result:
ok 1 number(s): "68284"
Test #17:
score: -21
Time Limit Exceeded
input:
100000 1 25138355 17042043 1791957 6455298 6022262 943678542 14813410 711168650 249633996 3186950 16632667 24001382 2843444 25153901 570090758 3077367 2314262 26140773 17228102 497847556 12294116 18909179 422337291 16067561 259209280 289237264 25047202 160449968 12519857 1244368 11282595 29145099 82...
output:
result:
Subtask #4:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%