oj.uz

Submission #529134

# Submission time Handle Problem Language Result Execution time Memory
529134 2022-02-22T09:49:56 Z alireza_kaviani Naan (JOI19_naan) C++11
5 / 100
 1 ms 448 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cstring>
#include <iomanip>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>
 
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int, int> pii;
 
const int maxn = 2012;
 
int vals[maxn][maxn];
int sum[maxn];
 
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, l; cin >> n >> l;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < l; j++)
        {
            cin >> vals[i][j];
            sum[i] += vals[i][j];
        }
    }
    int a = sum[0];
    int b = sum[1];
    pii x;
    int s = 0;
    int s2 = 0;
    for(int i = 0; i < l; i++)
    {
        int r = vals[0][i];
        int u = vals[1][i];
        if( 2*(s + r) < a )
        {
            s += r;
            s2 += u;
        }
        else
        {
            x = {a-2*s + 2*i*r, 2*r};
            cout << (a-2*s + 2*i*r) << " " << 2*r << endl;
            if( 2*s2 + u*(a-2*s) < b*r )
                cout << "1 2" << endl;
            else
                cout << "2 1" << endl;
            return 0;
        }
    }
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB X_i is not increasing
3 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Incorrect 1 ms 332 KB X_i is not increasing
18 Halted 0 ms 0 KB -