Submission #5796475


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define llong long long int
#define ldouble long double
#define rep(i, n) for (int i = 0; i < n; ++i) 
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define stl_repr(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()

const static int MOD = 1000000000 + 7;
const static int inf = INT_MAX / 2;
const static llong INF = 1LL << 31;
const static int dx[] = {1, 0, -1, 0};
const static int dy[] = {0, 1, 0, -1};

int main (int argc, char *argv[]) {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int t;
    cin >> t;
    if (t == 1) cout << 2 << " " << -2 << endl;
    return 0;
}

Submission Info

Submission Time
Task A - A + B
User yumarimo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 762 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 33 0 / 33 0 / 34
Status
WA × 1
WA × 1
WA × 1
Set Name Test Cases
Subtask1 1.txt
Subtask2 2.txt
Subtask3 3.txt
Case Name Status Exec Time Memory
1.txt WA 1 ms 256 KB
2.txt WA 1 ms 256 KB
3.txt WA 1 ms 256 KB