Submission #322563
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.first)
#define cdr(a) (a.second)
#define cadr(a) (car(cdr(a)))
#define cddr(a) (cdr(cdr(a)))
#define all(a) a.begin(), a.end()
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
typedef long long Integer;
typedef double Real;
typedef vector<int> vi;
typedef vector<string> vs;
typedef map<string,int> Dictionary;
const Real PI = acos(-1);
template<class S, class T>
ostream& operator<<(ostream& os, pair<S,T> p) {
os << '(' << car(p) << ", " << cdr(p) << ')';
return os;
}
template<class T>
ostream& operator<<(ostream& os, vector<T> v) {
if (v.size() == 0) {
os << "(empty)";
return os;
}
os << v[0];
for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
return os;
}
int dx[] = { -1, 0, 1, 0 };
int dy[] = { 0, -1, 0, 1 };
int main() {
int n,m; cin >> n >> m;
cout
<< ((m*540) + ((n-m)*525))
<< endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - プレミアム会員 |
User |
cympfh |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1267 Byte |
Status |
AC |
Exec Time |
29 ms |
Memory |
916 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_random09.txt, subtask1_random10.txt, subtask1_random11.txt, subtask1_random12.txt, subtask1_random13.txt, subtask1_random14.txt, subtask1_random15.txt, subtask1_random16.txt, subtask1_random17.txt, subtask1_random18.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
25 ms |
800 KB |
subtask0_sample_02.txt |
AC |
24 ms |
800 KB |
subtask0_sample_03.txt |
AC |
25 ms |
796 KB |
subtask0_sample_04.txt |
AC |
25 ms |
676 KB |
subtask1_random01.txt |
AC |
26 ms |
804 KB |
subtask1_random02.txt |
AC |
26 ms |
800 KB |
subtask1_random03.txt |
AC |
27 ms |
800 KB |
subtask1_random04.txt |
AC |
25 ms |
800 KB |
subtask1_random05.txt |
AC |
25 ms |
796 KB |
subtask1_random06.txt |
AC |
26 ms |
800 KB |
subtask1_random07.txt |
AC |
29 ms |
760 KB |
subtask1_random08.txt |
AC |
25 ms |
788 KB |
subtask1_random09.txt |
AC |
27 ms |
796 KB |
subtask1_random10.txt |
AC |
26 ms |
916 KB |
subtask1_random11.txt |
AC |
26 ms |
800 KB |
subtask1_random12.txt |
AC |
26 ms |
788 KB |
subtask1_random13.txt |
AC |
26 ms |
732 KB |
subtask1_random14.txt |
AC |
27 ms |
672 KB |
subtask1_random15.txt |
AC |
27 ms |
796 KB |
subtask1_random16.txt |
AC |
27 ms |
800 KB |
subtask1_random17.txt |
AC |
25 ms |
796 KB |
subtask1_random18.txt |
AC |
27 ms |
796 KB |