Submission #5391540
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define int long long #define endl "\n" #define REP(i,a,n) for(int i=a;i<n;++i) #define RUP(a,b) ((a+b-1)/(b)) #define SORTG(v) sort(v.begin(),v.end(),greater<>()) #define SORT(v) sort(v.begin(),v.end()) #define ALL(v) (v).begin(),(v).end() #define pb push_back #define mp make_pair #define mt make_tuple #define MOD 1000000007 #define INF LLONG_MAX/3 typedef long long ll; typedef pair<int,int> Pii; typedef tuple<int,int,int> Tiii; typedef vector<int> Vi; typedef vector<Vi> VVi; typedef vector<string> Vs; template<class T> void chmax(T& a, T b) {if(a<b){a=b;}} template<class T> void chmin(T& a, T b) {if(a>b){a=b;}} void YesNo(int a) {if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}} void YESNO(int a) {if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}} void AorB(int a,string b,string c) {if(a){cout<<b<<endl;}else{cout<<c<<endl;}} int gcd(int a,int b){return b?gcd(b,a%b):a;} void start(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);} int n; bool check(int x){ if(x*(x+1)>=2*n) return true; else return false; } signed main(){start(); cin>>n; int low=0,high=10000000; while(high-low>1){ int mid=(low+high)/2; if(check(mid)) high=mid; else low=mid; } REP(i,1,high+1) if(i!=high*(high+1)/2-n) cout<<i<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | hanaoka_ |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1386 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 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 | 2 ms | 256 KB |
02-02.txt | AC | 2 ms | 256 KB |
02-03.txt | AC | 2 ms | 256 KB |
02-04.txt | AC | 2 ms | 256 KB |
02-05.txt | AC | 1 ms | 256 KB |
02-06.txt | AC | 1 ms | 256 KB |
02-07.txt | AC | 1 ms | 256 KB |
02-08.txt | AC | 2 ms | 256 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 |