Submission #6200769
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <string> #include <vector> #include <list> #include <set> #include <map> #include <queue> #include <stack> #include <cctype> #include <climits> #include <bitset> using namespace std; typedef long double ld; typedef long long int ll; typedef unsigned long long int ull; typedef vector<int> vi; typedef vector<char> vc; typedef vector<string> vs; typedef vector<pair<int,int> > vpii; typedef vector<vector<int> > vvi; typedef vector<vector<char> > vvc; typedef vector<vector<string> > vvs; #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define fin(ans) cout<<(ans)<<endl #define P 1000000007 #define STI(s) atoi(s.c_str())//string to int #define mp(p,q) make_pair(p,q) #define pb(n) push_back(n) #define Sort(a) sort(a.begin(),a.end()) template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;} template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} const int INF = INT_MAX; const long long LLINF = 1LL<<60; //g++ -std=c++1z temp.cpp //./a.out int main(void){ios::sync_with_stdio(false);cin.tie(0); ////////////////////////////////////////////////////// //dp[i]=点数の合計がNの時の配点の最大値 int n; cin>>n; vi dp(n+1,-1); dp[0]=0; dp[1]=1; for(int i=2;i<=n;i++){ if(dp[i-1]*(dp[i-1]+1)/2<i)dp[i]=dp[i-1]+1; else dp[i]=dp[i-1]; } while(n>0){ cout<<dp[n]<<endl; n-=dp[n]; } ////////////////////////////////////////////////////// return 0;}
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | xryuseix |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1720 Byte |
Status | AC |
Exec Time | 69 ms |
Memory | 39296 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 69 ms | 39296 KB |
02-02.txt | AC | 69 ms | 39296 KB |
02-03.txt | AC | 69 ms | 39296 KB |
02-04.txt | AC | 69 ms | 39296 KB |
02-05.txt | AC | 69 ms | 39296 KB |
02-06.txt | AC | 22 ms | 11136 KB |
02-07.txt | AC | 12 ms | 5376 KB |
02-08.txt | AC | 65 ms | 36480 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |