oj.uz

Submission #375255

# Submission time Handle Problem Language Result Execution time Memory
375255 2021-03-09T05:35:06 Z daniel920712 Naan (JOI19_naan) C++14
5 / 100
 1 ms 492 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>

using namespace std;

long long all[2005][2005];
long long sum[2005][2005]={0};
long long tt[2005];
vector < pair < long long , long long > > ans;
int main()
{
    long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
    scanf("%lld %lld",&N,&M);
    for(i=0;i<N;i++)
    {
        sum[i][0]=0;
        for(j=0;j<M;j++)
        {
            scanf("%lld",&all[i][j]);
            sum[i][j]=sum[i][j-1]+all[i][j];
        }
    }
    for(i=0;i<N;i++) tt[i]=i;
    do
    {
        ans.clear();
        x1=0;
        y1=1;
        now=0;
        for(i=0;i<M;i++)
        {
            x3=1;
            y3=1;
            while(1)
            {
                x2=x1*y3+x3*y1*all[tt[now]][i];
                y2=y1*y3;
                //printf("%lld %lld %lld %lld %lld\n",x2,y2,i,x3,y3);
                if(x2*N>=sum[tt[now]][M-1]*y2)
                {
                    //printf("aa %lld %lld %lld\n",i,x3,y3);
                    //printf("%lld %lld %lld %lld\n",i,now,x1,y1);
                    x2=sum[tt[now]][M-1]*y1-x1*N;
                    y2=y1*N*all[tt[now]][i];

                    //printf("%lld %lld %lld %lld\n",i,now,x2,y2);

                    x3=x3*y2-x2*y3;
                    y3*=y2;
                    if(now<=N-1)
                    {

                        if(now<N-1) ans.push_back(make_pair(x2+i*y2,y2));
                        now++;
                        y1=y3;
                        x1=x3*all[tt[now]][i];
                        //printf("bb %lld %lld\n",x2,y2);
                    }
                    if(now==N) break;
                }
                else
                {
                    x1=x2;
                    y1=y2;
                    break;
                }

            }
            if(now==N) break;
        }
        if(now==N)
        {
            for(auto i:ans) printf("%lld %lld\n",i.first,i.second);
            for(i=0;i<N;i++) printf("%lld ",tt[i]+1);
            return 0;
        }
    }while(next_permutation(tt,tt+N));
    printf("-1\n");
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:15:19: warning: unused variable 'a' [-Wunused-variable]
   15 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
      |                   ^
naan.cpp:15:21: warning: unused variable 'b' [-Wunused-variable]
   15 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
      |                     ^
naan.cpp:15:35: warning: unused variable 'c' [-Wunused-variable]
   15 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
      |                                   ^
naan.cpp:15:41: warning: unused variable 'ok' [-Wunused-variable]
   15 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
      |                                         ^~
naan.cpp:15:52: warning: unused variable 'z' [-Wunused-variable]
   15 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3;
      |                                                    ^
naan.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
naan.cpp:22:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   22 |             scanf("%lld",&all[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 492 KB Integer parameter [name=A_i] equals to 3223633920000, violates the range [1, 2000000000000]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Incorrect 1 ms 492 KB Integer parameter [name=A_i] equals to 3223633920000, violates the range [1, 2000000000000]
18 Halted 0 ms 0 KB -