io優化
cin.tie(0);
ios_base::sync_with_stdio(false);
int to string
.to_string()
32位元int to binary string
stoi()``string a2 = bitset<32>(a).to_string();
vector<int> v(10, 1); // create vector 10 slots value 1
vector<int> v[10]; // create vector 10 blank slots
v.erase(v.begin()+i);
v.erase(v.begin()+i, v.begin()+j);
priority_queue<資料型態> pq;
priority_queue<int, vector<int>, greater<int>> pq; // 最小優先
priority_queue<int> pq2(pq); // 宣告 pq2 並賦予 pq 的內容
pqpush(val);
pq.pop(); // delete but no return
bool isEmpty = pq.empty(); // check if is empty
pq.size(); // return length
// read each item in pq
while( !pq.empty() ){
int val = pq.top();
cout<< val << ' ';
pq.pop();
}
// use this is a the type of your comparator
typedef std::function<bool(int, int)> comp_type;
// priority queue using operator < for ordering
priority_queue<int, vector<int>, comp_type> first(std::less<int>());
// priority queue using operator > for ordering
priority_queue<int, vector<int>, comp_type> second(std::greater<int>());
https://zerojudge.tw/ShowProblem?problemid=f313```cpp= #include <bits/stdc++.h> using namespace std; /* 2 3 4 1 10 2 -1 5 -1 2 */ int main(){
Nov 2, 2021https://zerojudge.tw/ShowProblem?problemid=g501 #include <bits/stdc++.h> using namespace std; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); vector<int> v = { {1, 2, 3, 5, 6, 8, 11, 13, 17, 21, 22},
Oct 27, 2021#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; n -= 1; unsigned long long tri[120], side[120]; tri[0] = 1; side[0] = 3;
Oct 19, 2021#include <bits/stdc++.h> using namespace std; int main(){ int a, b, c; cin>>a>>b>>c; int lim = c/b; int h[a]; priority_queue< pair<int, int> > cans; // {height, place} for(int i=0; i<a; i++){ int can; cin>>can;
Oct 19, 2021or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up