Submission #574990
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; }
inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }
#define For(i,a,b) for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n) For(i,0,n)
#define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n) rFor(i,n,0)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define sz(a) (sizeof(a))
const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = 1e9 + 9;
int main(){
int d, u;
int n;
cin >> d >> u >> n;
rep(i, n){
int t;
cin >> t;
if (t > u){
cout << -1 << endl;
}else
if (t < d){
cout << d - t << endl;
}
else{
cout << 0 << endl;
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 運動管理 |
User |
omu |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
2484 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt |
All |
test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt |
Case Name |
Status |
Exec Time |
Memory |
sample-01.txt |
AC |
23 ms |
928 KB |
sample-02.txt |
AC |
23 ms |
800 KB |
test-01.txt |
AC |
23 ms |
796 KB |
test-02.txt |
AC |
24 ms |
800 KB |
test-03.txt |
AC |
23 ms |
924 KB |
test-04.txt |
AC |
23 ms |
800 KB |
test-05.txt |
AC |
23 ms |
796 KB |
test-06.txt |
AC |
23 ms |
800 KB |
test-07.txt |
AC |
23 ms |
800 KB |
test-08.txt |
AC |
25 ms |
804 KB |
test-09.txt |
AC |
25 ms |
736 KB |
test-10.txt |
AC |
23 ms |
924 KB |
test-11.txt |
AC |
25 ms |
924 KB |
test-12.txt |
AC |
23 ms |
796 KB |
test-13.txt |
AC |
23 ms |
924 KB |
test-14.txt |
AC |
25 ms |
928 KB |
test-15.txt |
AC |
24 ms |
672 KB |
test-16.txt |
AC |
27 ms |
808 KB |
test-17.txt |
AC |
23 ms |
672 KB |
test-18.txt |
AC |
23 ms |
800 KB |
test-19.txt |
AC |
23 ms |
920 KB |
test-20.txt |
AC |
23 ms |
800 KB |