oj.uz

답안 #375124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375124 2021-03-09T03:22:01 Z daniel920712 Naan (JOI19_naan) C++14
0 / 100
 344 ms 200092 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
 
using namespace std;
vector < long long > sum[2005];
long long all[2005];
int main()
{
    long long N,M,i,j,k,tt=0,t,x;
    scanf("%lld %lld",&N,&M);
    x=M;
    for(i=0;i<N;i++)
    {
        tt=0;
        sum[i].push_back(tt);
        for(j=0;j<M;j++)
        {
            scanf("%lld",&t);
            all[i]+=t;
            for(k=0;k<N*M;k++)
            {
                tt+=t;
                sum[i].push_back(tt);
            }
        }
    }
    M*=(N*M);
    for(i=1;i<M;i++)
    {
        if(sum[0][i]/all[0]>=x&&(sum[1][M]-sum[1][i])/all[1]>=x)
        {
            printf("%lld %lld\n",i,M/x);
            printf("1 2\n");
            return 0;
        }
        if(sum[1][i]/all[1]>=x&&(sum[0][M]-sum[0][i])/all[0]>=x)
        {
            printf("%lld %lld\n",i,M/x);
            printf("2 1\n");
            return 0;
        }
    }
    printf("1 %lld\n",i,M/x);
    printf("1 2\n");
    return 0;
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:45:12: warning: too many arguments for format [-Wformat-extra-args]
   45 |     printf("1 %lld\n",i,M/x);
      |            ^~~~~~~~~~
naan.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
naan.cpp:20:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |             scanf("%lld",&t);
      |             ~~~~~^~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 181 ms 102200 KB Output is correct
3 Correct 203 ms 111124 KB Output is correct
4 Correct 237 ms 122576 KB Output is correct
5 Correct 87 ms 68240 KB Output is correct
6 Correct 3 ms 2528 KB Output is correct
7 Correct 191 ms 100628 KB Output is correct
8 Correct 165 ms 108436 KB Output is correct
9 Correct 7 ms 4828 KB Output is correct
10 Correct 197 ms 124180 KB Output is correct
11 Incorrect 309 ms 117012 KB Not a fair distribution.
12 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 71188 KB Output is correct
2 Incorrect 344 ms 200092 KB X_i is not increasing
3 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 181 ms 102200 KB Output is correct
3 Correct 203 ms 111124 KB Output is correct
4 Correct 237 ms 122576 KB Output is correct
5 Correct 87 ms 68240 KB Output is correct
6 Correct 3 ms 2528 KB Output is correct
7 Correct 191 ms 100628 KB Output is correct
8 Correct 165 ms 108436 KB Output is correct
9 Correct 7 ms 4828 KB Output is correct
10 Correct 197 ms 124180 KB Output is correct
11 Incorrect 309 ms 117012 KB Not a fair distribution.
12 Halted 0 ms 0 KB -