oj.uz

Submission #375767

# Submission time Handle Problem Language Result Execution time Memory
375767 2021-03-10T00:49:17 Z daniel920712 Naan (JOI19_naan) C++14
29 / 100
 547 ms 96152 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]={0};
vector < pair < long long , long long > > ans;
vector < long long > ans2;
bool have[2005]={0};
vector < pair < pair < long long ,long long > , long long > > where[2005];
long long F(long long a,long long b)
{
    if(b==0) return a;
    return F(b,a%b);
}
bool cmp(pair < pair < long long ,long long > , long long > a,pair < pair < long long ,long long > , long long > b)
{
    return a.first.first*b.first.second<a.first.second*b.first.first;
}
int main()
{
    //freopen("03-03.txt","rt",stdin);
    long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
    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++)
    {
        x1=0;
        y1=1;
        now=0;

        for(j=0;j<M;j++)
        {
            while((x1+all[i][j]*y1)*N>=(sum[i][M-1])*(now+1)*y1)
            {
                x2=(sum[i][M-1])*(now+1)*y1-x1*N;
                y2=y1*N*all[i][j];
                where[now++].push_back(make_pair(make_pair(x2+j*y2,y2),i));
            }
            x1+=y1*all[i][j];
        }
    }

    for(i=0;i<N;i++) sort(where[i].begin(),where[i].end(),cmp);
    x1=0;
    y1=1;
    for(i=0;i<N;i++)
    {
        ok=0;
        for(auto j:where[i])
        {
            if(have[j.second]||x1*j.first.second>=y1*j.first.first) continue;
            ok=1;
            x1=j.first.first;
            y1=j.first.second;
            have[j.second]=1;
            ans.push_back(make_pair(j.first.first,j.first.second));
            ans2.push_back(j.second);
            break;
        }
        if(!ok) while(1) ;
    }    
    
    for(i=0;i<N-1;i++) printf("%lld %lld\n",ans[i].first,ans[i].second);
    for(auto i:ans2) printf("%lld ",i+1);
    //printf("%lld\n",M);
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:28:19: warning: unused variable 'a' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                   ^
naan.cpp:28:21: warning: unused variable 'b' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                     ^
naan.cpp:28:35: warning: unused variable 'c' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                                   ^
naan.cpp:28:52: warning: unused variable 'z' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                                                    ^
naan.cpp:28:54: warning: unused variable 'x3' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                                                      ^~
naan.cpp:28:57: warning: unused variable 'y3' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                                                         ^~
naan.cpp:28:60: warning: unused variable 't' [-Wunused-variable]
   28 |     long long N,M,a,b,x1,y1,x2,y2,c,i,j,ok=1,now=0,z,x3,y3,t;
      |                                                            ^
naan.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
naan.cpp:35:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |             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 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 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 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 2 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 2 ms 620 KB Output is correct
19 Correct 2 ms 620 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 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 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 620 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 2 ms 620 KB Output is correct
30 Correct 1 ms 620 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 2 ms 620 KB Output is correct
33 Correct 2 ms 620 KB Output is correct
34 Correct 2 ms 620 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 2 ms 640 KB Output is correct
37 Correct 2 ms 620 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 492 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 2 ms 492 KB Output is correct
43 Correct 92 ms 20844 KB Output is correct
44 Incorrect 547 ms 96152 KB X_i is not increasing
45 Halted 0 ms 0 KB -