Submission #322576
Source Code Expand
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <unordered_map>
#include <iterator>
#include <functional>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}
const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;
int n, x;
int main(int argc, char *argv[]){
ios::sync_with_stdio(false);
cin >> n >> x;
cout << 540*x + 525*(n-x) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - プレミアム会員 |
User |
zerokugi |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2524 Byte |
Status |
AC |
Exec Time |
51 ms |
Memory |
932 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 |
796 KB |
subtask0_sample_02.txt |
AC |
24 ms |
804 KB |
subtask0_sample_03.txt |
AC |
24 ms |
920 KB |
subtask0_sample_04.txt |
AC |
23 ms |
796 KB |
subtask1_random01.txt |
AC |
24 ms |
932 KB |
subtask1_random02.txt |
AC |
23 ms |
928 KB |
subtask1_random03.txt |
AC |
51 ms |
760 KB |
subtask1_random04.txt |
AC |
23 ms |
928 KB |
subtask1_random05.txt |
AC |
26 ms |
760 KB |
subtask1_random06.txt |
AC |
24 ms |
800 KB |
subtask1_random07.txt |
AC |
23 ms |
924 KB |
subtask1_random08.txt |
AC |
24 ms |
748 KB |
subtask1_random09.txt |
AC |
23 ms |
928 KB |
subtask1_random10.txt |
AC |
24 ms |
928 KB |
subtask1_random11.txt |
AC |
23 ms |
804 KB |
subtask1_random12.txt |
AC |
23 ms |
920 KB |
subtask1_random13.txt |
AC |
23 ms |
932 KB |
subtask1_random14.txt |
AC |
24 ms |
928 KB |
subtask1_random15.txt |
AC |
24 ms |
928 KB |
subtask1_random16.txt |
AC |
24 ms |
928 KB |
subtask1_random17.txt |
AC |
24 ms |
924 KB |
subtask1_random18.txt |
AC |
24 ms |
928 KB |