Submission #322562
Source Code Expand
#include <string> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <queue> #include <iostream> #include <sstream> #include <cstdio> #include <cmath> #include <ctime> #include <cstring> #include <cctype> #include <cassert> #include <limits> #include <functional> #include <unordered_map> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll; template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int n, x; cin >> n >> x; int ans = x * 540 + (n - x) * 525; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | anta |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1352 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 920 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 | 23 ms | 804 KB |
subtask0_sample_02.txt | AC | 22 ms | 800 KB |
subtask0_sample_03.txt | AC | 24 ms | 800 KB |
subtask0_sample_04.txt | AC | 24 ms | 796 KB |
subtask1_random01.txt | AC | 22 ms | 676 KB |
subtask1_random02.txt | AC | 23 ms | 728 KB |
subtask1_random03.txt | AC | 24 ms | 800 KB |
subtask1_random04.txt | AC | 22 ms | 856 KB |
subtask1_random05.txt | AC | 24 ms | 736 KB |
subtask1_random06.txt | AC | 24 ms | 800 KB |
subtask1_random07.txt | AC | 25 ms | 920 KB |
subtask1_random08.txt | AC | 24 ms | 796 KB |
subtask1_random09.txt | AC | 24 ms | 668 KB |
subtask1_random10.txt | AC | 26 ms | 800 KB |
subtask1_random11.txt | AC | 26 ms | 840 KB |
subtask1_random12.txt | AC | 23 ms | 800 KB |
subtask1_random13.txt | AC | 23 ms | 912 KB |
subtask1_random14.txt | AC | 25 ms | 800 KB |
subtask1_random15.txt | AC | 24 ms | 664 KB |
subtask1_random16.txt | AC | 26 ms | 752 KB |
subtask1_random17.txt | AC | 23 ms | 804 KB |
subtask1_random18.txt | AC | 23 ms | 784 KB |