QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#469408#8892. Power GridLynkcat#13 200ms18864kbC++202.2kb2024-07-09 18:52:522024-07-09 18:52:54

Judging History

This is the latest submission verdict.

  • [2024-07-09 18:52:54]
  • Judged
  • Verdict: 13
  • Time: 200ms
  • Memory: 18864kb
  • [2024-07-09 18:52:52]
  • Submitted

answer

#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=1005;
int n,m;
int ans[N][N],b[N],a[N];
int c[N][N];
void dfs(int k,int sm)
{
    if (k==n)
    {
        // cout<<"??"<<sm<<" "<<" "<<(n-m)<<endl;
        if (sm!=0&&(n==m||sm%(n-m)!=0)) return;

        // for (int i=0;i<n;i++) cout<<b[i]<<" ";cout<<endl;
        // for (int i=0;i<m;i++) cout<<a[i]<<" ";cout<<endl;
        int o=0;
        if (sm!=0) o=sm/(n-m);
        // cout<<"??"<<o<<endl;
        for (int i=0;i<m;i++) a[i]-=o;
        for (int i=0;i<n;i++) b[i]-=o;

        // for (int i=0;i<n;i++) cout<<b[i]<<" ";cout<<endl;
        // for (int i=0;i<m;i++) cout<<a[i]<<" ";cout<<endl;

        for (int i=1;i<m;i++) ans[0][i]=a[i],b[0]-=a[i];
        // cout<<"??"<<b[1]<<endl;
        for (int i=0;i<n;i++)
        {
            ans[i][0]=b[i];
        }
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<m;j++) cout<<ans[i][j]<<" ";
            cout<<'\n';
        }
        fflush(stdout);
        exit(0);
    }
    int l=-12,r=12;
    for (int i=l;i<=r;i++)
    {
        b[k]=i;
        bool bl=1;
        for (int j=0;j<m;j++)
        {
            if (abs(b[k]-a[j])!=c[k][j])
            {
                bl=0;
                break;
            }
        }
        if (bl) dfs(k+1,sm+i);
    }
}
void BellaKira()
{
    cin>>n>>m;
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
            cin>>c[i][j];
    for (int s=0;s<(1<<m);s++)
    {
        poly g;
        for (int i=0;i<m;i++)
            if ((s>>i)&1) a[i]=c[0][i];
            else a[i]=-c[0][i];
        // for (int i=0;i<m;i++)
        //     cout<<a[i]<<" ";
        // cout<<endl;
        int sm=0;
        for (int i=0;i<m;i++) sm-=a[i];
        dfs(1,sm);
    }
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}

詳細信息

Subtask #1:

score: 8
Accepted

Test #1:

score: 8
Accepted
time: 1ms
memory: 5608kb

input:

1 1
0

output:

0 

result:

ok correct

Test #2:

score: 0
Accepted
time: 1ms
memory: 5660kb

input:

1 1
0

output:

0 

result:

ok correct

Test #3:

score: 0
Accepted
time: 1ms
memory: 5760kb

input:

1 2
1 1

output:

1 1 

result:

ok correct

Test #4:

score: 0
Accepted
time: 1ms
memory: 5672kb

input:

3 1
0
3
1

output:

2 
-1 
1 

result:

ok correct

Test #5:

score: 0
Accepted
time: 1ms
memory: 5672kb

input:

2 2
1 1
1 1

output:

1 -1 
-2 0 

result:

ok correct

Test #6:

score: 0
Accepted
time: 1ms
memory: 5616kb

input:

3 3
2 1 1
2 1 1
0 1 3

output:

0 1 -1 
0 0 0 
2 0 0 

result:

ok correct

Test #7:

score: 0
Accepted
time: 1ms
memory: 5684kb

input:

3 3
0 1 0
2 1 2
1 2 1

output:

1 -1 0 
-2 0 0 
1 0 0 

result:

ok correct

Test #8:

score: 0
Accepted
time: 0ms
memory: 5760kb

input:

3 3
0 0 2
2 2 0
0 0 2

output:

2 0 -2 
-2 0 0 
0 0 0 

result:

ok correct

Test #9:

score: 0
Accepted
time: 0ms
memory: 5600kb

input:

3 3
3 1 2
3 1 2
3 1 2

output:

3 -1 -2 
0 0 0 
0 0 0 

result:

ok correct

Test #10:

score: 0
Accepted
time: 0ms
memory: 5604kb

input:

3 3
3 3 3
0 0 0
3 3 3

output:

6 -3 -3 
-3 0 0 
-6 0 0 

result:

ok correct

Subtask #2:

score: 5
Accepted

Dependency #1:

100%
Accepted

Test #11:

score: 5
Accepted
time: 1ms
memory: 5680kb

input:

1 6
1 0 3 1 3 0

output:

1 0 3 -1 -3 0 

result:

ok correct

Test #12:

score: 0
Accepted
time: 1ms
memory: 5752kb

input:

6 1
2
1
1
1
5
0

output:

2 
1 
1 
1 
-5 
0 

result:

ok correct

Test #13:

score: 0
Accepted
time: 1ms
memory: 5684kb

input:

6 6
3 1 0 3 4 0
1 1 2 1 2 2
1 1 2 1 2 2
1 3 4 1 0 4
1 1 2 1 2 2
2 0 1 2 3 1

output:

8 -1 0 -3 -4 0 
-2 0 0 0 0 0 
-2 0 0 0 0 0 
-4 0 0 0 0 0 
-2 0 0 0 0 0 
-1 0 0 0 0 0 

result:

ok correct

Test #14:

score: 0
Accepted
time: 1ms
memory: 5776kb

input:

6 6
2 4 4 0 2 2
5 1 1 3 1 1
4 2 2 2 0 0
2 4 4 0 2 2
6 0 0 4 2 2
3 3 3 1 1 1

output:

12 -4 -4 0 -2 -2 
-3 0 0 0 0 0 
-2 0 0 0 0 0 
0 0 0 0 0 0 
-4 0 0 0 0 0 
-1 0 0 0 0 0 

result:

ok correct

Test #15:

score: 0
Accepted
time: 1ms
memory: 5692kb

input:

6 6
1 0 4 5 3 2
4 5 1 0 2 3
3 4 0 1 1 2
2 3 1 2 0 1
1 2 2 3 1 0
0 1 3 4 2 1

output:

14 0 -4 -5 -3 -2 
-5 0 0 0 0 0 
-4 0 0 0 0 0 
-3 0 0 0 0 0 
-2 0 0 0 0 0 
-1 0 0 0 0 0 

result:

ok correct

Test #16:

score: 0
Accepted
time: 0ms
memory: 7740kb

input:

6 6
6 4 2 4 1 3
6 4 2 4 1 3
6 4 2 4 1 3
6 4 2 4 1 3
6 4 2 4 1 3
6 4 2 4 1 3

output:

6 4 -2 -4 -1 -3 
0 0 0 0 0 0 
0 0 0 0 0 0 
0 0 0 0 0 0 
0 0 0 0 0 0 
0 0 0 0 0 0 

result:

ok correct

Test #17:

score: 0
Accepted
time: 1ms
memory: 5752kb

input:

6 3
6 3 3
6 3 3
6 3 3
6 3 3
6 3 3
6 3 3

output:

10 -7 -7 
-4 0 0 
-4 0 0 
-4 0 0 
-4 0 0 
-4 0 0 

result:

ok correct

Test #18:

score: 0
Accepted
time: 1ms
memory: 5644kb

input:

6 3
1 1 1
2 2 2
5 5 5
6 6 6
6 6 6
2 2 2

output:

-1 2 2 
0 0 0 
7 0 0 
-4 0 0 
-4 0 0 
4 0 0 

result:

ok correct

Test #19:

score: 0
Accepted
time: 1ms
memory: 5632kb

input:

3 6
6 5 5 5 5 5
6 5 5 5 5 5
6 5 5 5 5 5

output:

-13 12 2 2 2 2 
7 0 0 0 0 0 
7 0 0 0 0 0 

result:

ok correct

Test #20:

score: 0
Accepted
time: 1ms
memory: 5700kb

input:

6 3
5 5 5
5 5 5
6 6 6
5 5 5
5 5 5
5 5 5

output:

-2 7 7 
2 0 0 
1 0 0 
2 0 0 
2 0 0 
2 0 0 

result:

ok correct

Test #21:

score: 0
Accepted
time: 1ms
memory: 5616kb

input:

6 4
1 6 2 3
1 6 2 3
1 6 2 3
1 6 2 3
1 6 2 3
1 6 2 3

output:

23 -12 -8 -9 
-6 0 0 0 
-6 0 0 0 
-6 0 0 0 
-6 0 0 0 
-6 0 0 0 

result:

ok correct

Test #22:

score: 0
Accepted
time: 1ms
memory: 5692kb

input:

6 6
2 2 1 4 1 1
2 2 1 4 1 1
3 3 0 3 0 2
2 2 1 4 1 1
2 2 1 4 1 1
2 2 1 4 1 1

output:

-3 -2 1 4 1 -1 
0 0 0 0 0 0 
1 0 0 0 0 0 
0 0 0 0 0 0 
0 0 0 0 0 0 
0 0 0 0 0 0 

result:

ok correct

Subtask #3:

score: 0
Wrong Answer

Test #23:

score: 11
Accepted
time: 1ms
memory: 5632kb

input:

1 1
0

output:

0 

result:

ok correct

Test #24:

score: 0
Accepted
time: 1ms
memory: 5668kb

input:

1 10
230 289 918 752 224 184 573 217 398 715

output:

270 211 -418 -252 276 316 -73 283 102 -215 

result:

ok correct

Test #25:

score: 0
Accepted
time: 1ms
memory: 5700kb

input:

1 1000
298 440 513 326 225 36 897 92 347 346 919 370 28 957 593 332 736 960 346 969 329 893 380 523 104 345 860 451 290 958 164 386 508 786 605 778 453 500 376 670 86 283 844 408 282 541 479 827 9 558 473 251 184 694 920 905 1000 515 846 506 741 403 552 869 37 667 377 350 711 304 509 471 164 901 487...

output:

202 60 -13 174 275 464 -397 408 153 154 -419 130 472 -457 -93 168 -236 -460 154 -469 171 -393 120 -23 396 155 -360 49 210 -458 336 114 -8 -286 -105 -278 47 0 124 -170 414 217 -344 92 218 -41 21 -327 491 -58 27 249 316 -194 -420 -405 -500 -15 -346 -6 -241 97 -52 -369 463 -167 123 150 -211 196 -9 29 3...

result:

ok correct

Test #26:

score: 0
Accepted
time: 1ms
memory: 5704kb

input:

1 1000
684 573 532 550 99 296 284 671 559 397 215 977 399 460 710 152 111 966 525 184 613 982 274 805 541 238 258 357 884 969 343 700 55 610 351 470 212 842 908 911 752 593 257 396 343 937 253 395 452 718 513 754 990 149 853 895 783 329 20 728 119 602 15 202 475 49 578 427 27 349 547 225 223 209 197...

output:

-184 -73 -32 -50 401 204 216 -171 -59 103 285 -477 101 40 -210 348 389 -466 -25 316 -113 -482 226 -305 -41 262 242 143 -384 -469 157 -200 445 -110 149 30 288 -342 -408 -411 -252 -93 243 104 157 -437 247 105 48 -218 -13 -254 -490 351 -353 -395 -283 171 480 -228 381 -102 485 298 25 451 -78 73 473 151 ...

result:

ok correct

Test #27:

score: -11
Wrong Answer
time: 1ms
memory: 5624kb

input:

1 1000
379 888 365 408 845 405 394 954 362 367 421 913 426 418 401 422 389 890 393 898 924 405 916 408 378 419 393 372 398 863 363 903 408 872 403 372 368 383 400 401 849 878 386 923 863 410 884 387 905 388 929 390 338 416 385 388 420 371 930 411 391 923 389 952 388 385 387 936 931 384 867 889 390 8...

output:


result:

wrong output format Unexpected end of file - int32 expected

Subtask #4:

score: 0
Wrong Answer

Test #30:

score: 6
Accepted
time: 0ms
memory: 5696kb

input:

2 2
0 0
0 0

output:

0 0 
0 0 

result:

ok correct

Test #31:

score: 0
Accepted
time: 0ms
memory: 5632kb

input:

2 2
7 7
7 7

output:

7 -7 
0 0 

result:

ok correct

Test #32:

score: 0
Accepted
time: 0ms
memory: 7740kb

input:

2 4
7 7 7 7
7 7 7 7

output:

-7 7 7 7 
14 0 0 0 

result:

ok correct

Test #33:

score: 0
Accepted
time: 1ms
memory: 5760kb

input:

20 40
80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80
80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80
80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 ...

output:

-2960 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 
160 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
160 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
160 0 0 0 ...

result:

ok correct

Test #34:

score: 0
Accepted
time: 1ms
memory: 5840kb

input:

20 40
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 ...

output:

-370 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 
20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
20 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
20 0 0 0 0 0 ...

result:

ok correct

Test #35:

score: -6
Wrong Answer
time: 200ms
memory: 11892kb

input:

1000 1000
1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 ...

output:


result:

wrong output format Unexpected end of file - int32 expected

Subtask #5:

score: 0
Wrong Answer

Test #46:

score: 0
Wrong Answer
time: 1ms
memory: 5672kb

input:

2 4
253 431 207 483
243 65 289 13

output:


result:

wrong output format Unexpected end of file - int32 expected

Subtask #6:

score: 0
Time Limit Exceeded

Test #58:

score: 5
Accepted
time: 73ms
memory: 18864kb

input:

1000 1000
1 0 0 1 0 1 0 1 0 0 1 1 0 0 1 1 1 1 1 1 1 1 0 0 0 1 0 1 1 0 1 1 0 1 1 1 0 0 1 1 0 0 0 1 1 0 1 1 0 1 1 1 0 0 0 1 0 0 0 1 0 1 1 0 0 0 1 0 0 0 1 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 0 0 1 1 0 1 0 1 1 1 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 1 0 1 1 0 0 0 0 1 1 0 1 1 ...

output:

495 0 0 -1 0 -1 0 -1 0 0 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 0 0 0 -1 0 -1 -1 0 -1 -1 0 -1 -1 -1 0 0 -1 -1 0 0 0 -1 -1 0 -1 -1 0 -1 -1 -1 0 0 0 -1 0 0 0 -1 0 -1 -1 0 0 0 -1 0 0 0 -1 -1 0 -1 -1 0 0 0 0 -1 0 -1 -1 0 0 0 0 0 -1 0 -1 -1 0 0 -1 -1 0 -1 0 -1 -1 -1 -1 0 -1 -1 0 0 -1 0 -1 0 -1 -1 0 -1 0 0 0 0...

result:

ok correct

Test #59:

score: -5
Time Limit Exceeded

input:

1000 1000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

output:


result:


Subtask #7:

score: 0
Wrong Answer

Test #68:

score: 0
Wrong Answer
time: 0ms
memory: 5688kb

input:

2 2
5 52
52 5

output:


result:

wrong output format Unexpected end of file - int32 expected

Subtask #8:

score: 0
Wrong Answer

Dependency #2:

100%
Accepted

Test #83:

score: 0
Wrong Answer
time: 1ms
memory: 6148kb

input:

100 100
14 50 6 9 35 31 9 1 40 31 30 17 58 53 33 43 19 37 41 35 20 51 29 44 20 19 4 4 59 29 56 50 37 38 49 59 41 1 37 10 19 41 2 4 29 20 13 7 25 25 54 31 38 14 22 3 35 37 22 49 35 29 1 24 23 7 38 9 41 33 55 19 19 17 8 55 59 9 29 8 40 36 21 3 12 24 59 59 2 14 59 59 0 15 19 37 2 9 3 20
60 4 40 55 81 1...

output:


result:

wrong output format Unexpected end of file - int32 expected

Subtask #9:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

0%