oj.uz

Submission #773657

# Submission time Handle Problem Language Result Execution time Memory
773657 2023-07-05T07:39:08 Z CyberCow Remittance (JOI19_remittance) C++17
0 / 100
 1000 ms 340 KB 
//#include <bits/stdc++.h>
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);
const int N = 1000005;
int a[N], b[N];

void solve()
{
    int n, i, j, x, y, gum1 = 0, gum = 0;
    cin >> n;
    for ( i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        gum += a[i];
        gum1 += b[i];
    }
    i = 0;
    int st = 0, qan = 0;
    while (gum >= gum1)
    {
        qan++;
        i++;
        if (i == n + 1)
        {
            if (st == n)
                break;
            i = 1;
            st = 0;
        }
        if (i < n)
        {
            if (a[i] > b[i])
            {
                if (a[i] - (a[i] - b[i] + 1) / 2 * 2 >= 0)
                {
                    gum -= (a[i] - b[i] + 1) / 2 * 2;
                    gum += (a[i] - b[i] + 1) / 2;
                    a[i + 1] += (a[i] - b[i] + 1) / 2;
                    a[i] -= (a[i] - b[i] + 1) / 2 * 2;
                }
            }
        }
        else
        {
            if (a[i] > b[i])
            {
                if (a[i] - (a[i] - b[i] + 1) / 2 * 2 >= 0)
                {
                    gum -= (a[i] - b[i] + 1) / 2 * 2;
                    gum += (a[i] - b[i] + 1) / 2;
                    a[1] += (a[i] - b[i] + 1) / 2;
                    a[i] -= (a[i] - b[i] + 1) / 2 * 2;
                }
            }
        }
        if (a[i] == b[i])
            st++;
        /*if (qan >= 10000000)
            break;*/
    }
    if (gum == gum1)
        cout << "Yes";
    else
        cout << "No";
}


int main() {    
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

remittance.cpp: In function 'void solve()':
remittance.cpp:33:15: warning: unused variable 'j' [-Wunused-variable]
   33 |     int n, i, j, x, y, gum1 = 0, gum = 0;
      |               ^
remittance.cpp:33:18: warning: unused variable 'x' [-Wunused-variable]
   33 |     int n, i, j, x, y, gum1 = 0, gum = 0;
      |                  ^
remittance.cpp:33:21: warning: unused variable 'y' [-Wunused-variable]
   33 |     int n, i, j, x, y, gum1 = 0, gum = 0;
      |                     ^

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Execution timed out 1091 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Execution timed out 1091 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Execution timed out 1091 ms 340 KB Time limit exceeded
17 Halted 0 ms 0 KB -