제출 #773771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773771		CyberCow	송금 (JOI19_remittance)	C++17	15 / 100	403 ms	360 KiB

remittance

//#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;
ll a[N], b[N];

void solve()
{
    ll 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
                {
                    gum -= (a[i] - b[i] + 1) / 2 * 2 - 2;
                    gum += (a[i] - b[i] + 1) / 2 - 1;
                    a[i + 1] += (a[i] - b[i] + 1) / 2 - 1;
                    a[i] -= (a[i] - b[i] + 1) / 2 * 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;
                }
                else
                {
                    gum -= (a[i] - b[i] + 1) / 2 * 2 - 2;
                    gum += (a[i] - b[i] + 1) / 2 - 1;
                    a[1] += (a[i] - b[i] + 1) / 2 - 1;
                    a[i] -= (a[i] - b[i] + 1) / 2 * 2 - 2;
                }
            }
        }
        if (a[i] == b[i])
            st++;
        if (qan >= 100000000)
            break;
    }
    if (gum == gum1 && (qan != 100000000 || n > 7))
        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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 15 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45