Submission #856758


Source Code Expand

Copy
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>

#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define PB push_back
#define MP make_pair
#define FST first
#define SND second
#define SZ(a) (signed)((a).size())
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;

const int MOD = 1000000007;
const char ENDL = '\n';

#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"  << " " << __FILE__ << endl;

signed main(void) {
    ios::sync_with_stdio(false);
    cout.setf(ios::fixed, ios::floatfield);
    cout.precision(10);
    cin.tie(0);

    int n, s;
    cin >> n >> s;

    if(n==s){
        cout << n+1 << ENDL;
    }else{
        if(s>n/2) {
            cout << -1 << ENDL;
        }else {
            cout << n-s << ENDL;
        }
    }

    return 0;
}

Submission Info

Submission Time
Task D - Digit Sum
User NSTomoS
Language C++11 (GCC 4.8.1)
Score 0
Code Size 1543 Byte
Status WA
Exec Time 5 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 3
AC × 13
WA × 34
Set Name Test Cases
Sample subtask1_87654_30.txt, subtask1_87654_138.txt, subtask1_87654_45678.txt, subtask1_31415926535_1.txt, subtask1_1_31415926535.txt
All subtask1_100000000000_1.txt, subtask1_100000000000_100000000000.txt, subtask1_100000000000_2.txt, subtask1_100000000000_3.txt, subtask1_100000000000_50000000000.txt, subtask1_100000000000_50000000001.txt, subtask1_100000000000_99999999999.txt, subtask1_16983563041_1.txt, subtask1_1_1.txt, subtask1_1_2.txt, subtask1_1_31415926535.txt, subtask1_239484768_194586924.txt, subtask1_2_1.txt, subtask1_2_2.txt, subtask1_31415926535_1.txt, subtask1_49234683534_2461734011.txt, subtask1_4_1.txt, subtask1_58640129658_232122496.txt, subtask1_68719476735_35.txt, subtask1_68719476735_36.txt, subtask1_68719476735_37.txt, subtask1_68719476736_1.txt, subtask1_68719476736_2.txt, subtask1_72850192441_16865701.txt, subtask1_79285169301_27.txt, subtask1_82914867733_1676425945.txt, subtask1_8594813796_75700.txt, subtask1_87654_12345.txt, subtask1_87654_138.txt, subtask1_87654_30.txt, subtask1_87654_4294967308.txt, subtask1_87654_45678.txt, subtask1_97822032312_49157112.txt, subtask1_98750604051_977728851.txt, subtask1_99999515529_1.txt, subtask1_99999515529_316226.txt, subtask1_99999515529_316227.txt, subtask1_99999515529_316228.txt, subtask1_99999515529_49999757765.txt, subtask1_99999515529_49999757766.txt, subtask1_99999515530_2.txt, subtask1_99999999977_1.txt, subtask1_99999999977_2.txt, subtask1_99999999977_49999999989.txt, subtask1_99999999977_49999999990.txt, subtask1_99999999999_1.txt, subtask1_99999999999_100000000000.txt
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt WA 5 ms 256 KB
subtask1_100000000000_100000000000.txt AC 4 ms 256 KB
subtask1_100000000000_2.txt WA 4 ms 256 KB
subtask1_100000000000_3.txt WA 4 ms 256 KB
subtask1_100000000000_50000000000.txt WA 4 ms 256 KB
subtask1_100000000000_50000000001.txt AC 4 ms 256 KB
subtask1_100000000000_99999999999.txt AC 5 ms 256 KB
subtask1_16983563041_1.txt WA 5 ms 256 KB
subtask1_1_1.txt AC 4 ms 256 KB
subtask1_1_2.txt AC 4 ms 256 KB
subtask1_1_31415926535.txt AC 4 ms 256 KB
subtask1_239484768_194586924.txt AC 4 ms 256 KB
subtask1_2_1.txt WA 4 ms 256 KB
subtask1_2_2.txt AC 4 ms 256 KB
subtask1_31415926535_1.txt WA 4 ms 256 KB
subtask1_49234683534_2461734011.txt WA 4 ms 256 KB
subtask1_4_1.txt WA 4 ms 256 KB
subtask1_58640129658_232122496.txt WA 4 ms 256 KB
subtask1_68719476735_35.txt WA 4 ms 256 KB
subtask1_68719476735_36.txt WA 4 ms 256 KB
subtask1_68719476735_37.txt WA 4 ms 256 KB
subtask1_68719476736_1.txt WA 4 ms 256 KB
subtask1_68719476736_2.txt WA 4 ms 256 KB
subtask1_72850192441_16865701.txt WA 4 ms 256 KB
subtask1_79285169301_27.txt WA 4 ms 256 KB
subtask1_82914867733_1676425945.txt WA 4 ms 256 KB
subtask1_8594813796_75700.txt WA 4 ms 256 KB
subtask1_87654_12345.txt WA 4 ms 256 KB
subtask1_87654_138.txt WA 4 ms 256 KB
subtask1_87654_30.txt WA 4 ms 256 KB
subtask1_87654_4294967308.txt AC 4 ms 256 KB
subtask1_87654_45678.txt AC 4 ms 256 KB
subtask1_97822032312_49157112.txt WA 4 ms 256 KB
subtask1_98750604051_977728851.txt WA 4 ms 256 KB
subtask1_99999515529_1.txt WA 4 ms 256 KB
subtask1_99999515529_316226.txt WA 4 ms 256 KB
subtask1_99999515529_316227.txt WA 4 ms 256 KB
subtask1_99999515529_316228.txt WA 4 ms 256 KB
subtask1_99999515529_49999757765.txt WA 4 ms 256 KB
subtask1_99999515529_49999757766.txt AC 4 ms 256 KB
subtask1_99999515530_2.txt WA 4 ms 256 KB
subtask1_99999999977_1.txt WA 4 ms 256 KB
subtask1_99999999977_2.txt WA 4 ms 256 KB
subtask1_99999999977_49999999989.txt WA 4 ms 256 KB
subtask1_99999999977_49999999990.txt AC 4 ms 256 KB
subtask1_99999999999_1.txt WA 4 ms 256 KB
subtask1_99999999999_100000000000.txt AC 4 ms 256 KB