Submission #772243

#	Time	Username	Problem	Language	Result	Execution time	Memory
772243		birthdaycake	Remittance (JOI19_remittance)	C++17	100 / 100	216 ms	36300 KiB

remittance

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
 
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#define endl '\n'
#define int long long
using namespace std;


int a[1000001],b[1000001];
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    
    int n; cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    
    while(true){
        int bad = 1, ff = 0, cnt = 0, bb = 0;
        for(int i = 1; i <= n; i++){
            int extra = a[i] - b[i];
            if(extra > 0 and extra != 1) bad = 0;
            if(extra != 0) ff = 1;
            if(extra == 1) cnt++;
            if(b[i] > 0) bb = 1;
        }
        if(bad){
            if(!ff) cout << "Yes";
            else if(cnt == n and bb) cout << "Yes";
            else cout << "No";
            return 0;
        }
        for(int i = 1; i <= n; i++){
            int extra = a[i] - b[i];
            if(extra <= 0) continue;
            if(extra % 2) extra--;
            if(extra == 0) continue;
            if(i == n) a[1] += (extra / 2);
            else a[i + 1] += (extra / 2);
            a[i] -= (extra);
        }
    }
    
    
    
    return 0;
}

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