Submission #322573
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <map> #include <queue> #include <stack> #include <set> #include <cmath> #include <vector> #include <deque> #include <cstdlib> #include <numeric> #include <cstring> #include <ctime> #include <climits> #include <sstream> #include <complex> #define Mp(a,b) make_pair((a),(b)) #define pb(a) push_back((a)) #define Rep(__i,__n) for(int __i = 0 ; __i < (__n);__i++) #define Range(_ind,_a,_b) for(int _ind = (_a) ; _ind <(int)(_b);_ind++) #define ForEach(__itr,__cont) for(typeof((__cont).begin()) __itr = (__cont).begin(); __itr != (__cont).end();__itr++ ) #define All(__cont) (__cont).begin(),(__cont).end() using namespace std; typedef complex<double> P; typedef long long ll; typedef vector<int> vi ; typedef vector<double> vd; typedef vector<vector <int> > vvi; typedef vector<vector<double> > vvd; typedef pair<int,int> pii; const int inf = INT_MAX / 3; const double eps = 1e-9; template <typename T> void debugvec(vector<T> &vec){ #ifdef DEBUG cout << "["; ForEach(itr,vec){ if(itr != vec.begin())cout << ","; cout << *itr; } cout << "]"<<endl;; #endif } int main(){ int n , k ; cin >> n >> k; cout << k*540 + (n-k)*525 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | ayashiro |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1278 Byte |
Status | AC |
Exec Time | 24 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 | 792 KB |
subtask0_sample_02.txt | AC | 22 ms | 796 KB |
subtask0_sample_03.txt | AC | 23 ms | 920 KB |
subtask0_sample_04.txt | AC | 22 ms | 916 KB |
subtask1_random01.txt | AC | 22 ms | 800 KB |
subtask1_random02.txt | AC | 24 ms | 736 KB |
subtask1_random03.txt | AC | 23 ms | 800 KB |
subtask1_random04.txt | AC | 23 ms | 800 KB |
subtask1_random05.txt | AC | 23 ms | 800 KB |
subtask1_random06.txt | AC | 23 ms | 796 KB |
subtask1_random07.txt | AC | 23 ms | 796 KB |
subtask1_random08.txt | AC | 23 ms | 804 KB |
subtask1_random09.txt | AC | 21 ms | 804 KB |
subtask1_random10.txt | AC | 21 ms | 796 KB |
subtask1_random11.txt | AC | 23 ms | 796 KB |
subtask1_random12.txt | AC | 21 ms | 796 KB |
subtask1_random13.txt | AC | 22 ms | 788 KB |
subtask1_random14.txt | AC | 21 ms | 792 KB |
subtask1_random15.txt | AC | 22 ms | 920 KB |
subtask1_random16.txt | AC | 23 ms | 800 KB |
subtask1_random17.txt | AC | 22 ms | 804 KB |
subtask1_random18.txt | AC | 23 ms | 796 KB |