記錄CSP題解

化學方程式

string fomular;

unordered_mapint> mymap;
struct element;}
;void
processword
(string word,
int type)if(
!flag) num =1;
while
(lo <= hi)
elseif(
isupper
(word[lo]))
);lo++;}
elseif(
islower
(word[lo]))
elseif(
isdigit
(word[lo]))
s.top(
).num = num;
}else
if(word[lo]
==')'
)else
count = num;
} vector tmp;
while
(s.top()
.name !=
"(")
s.pop();
for(
int i = tmp.
size()
-1; i >=
0; i--)}
}//對stack中的數字做係數乘累加到map中
while
(!s.
empty()
)else mymap[s.
top(
).name]
-= s.
top(
).num * num;
s.pop();
}}void
handle
(string s,
int type)
processword
(s.substr
(lo)
+')'
,type);}
intmain()
}if(!flag) cout <<
"y"
clear()
;}return0;
}

2.markdown

bool

judgeemptyrow
(string s)
return
true;}
string reduce
(string s)
while
(j >=
0&& s[j]
==' '
)return s.
substr
(i, j - i +1)
;}int line =1;
int biao =0;
void
add(
int w,
char c=
' ')
if(c ==
' '&& biao ==
1) biao =0;
}void
add2
(int w,
char c =
' ')
if(c ==
' '&& biao ==
4) biao =3;
}int
main()
if(str.
size()
>1)
// cout << line << endl;
continue;}
else
if(xiang==
1&& str[0]
==' '
&& str[1]
==' '
)// cout << line << endl;
continue;}
}if(xiang ==1)
if(duan ==0)
add(w)
; string tem =
reduce
(str)
;for
(int i =
0; i < tem.
size()
; i++
)// cout << line << endl;}if
(duan==1)
cout << line<}

#include

#include
#include
#include
#include
#include
#include
#include
#include
#include
using
namespace std;
struct commodity
;bool
operator
<
(commodity a,commodity b)
return a.label < b.label;
}return a.score > b.score;
}int
main()
);store[j]
[iid]
= sscore;}}
cin >> num;
for(
int i =
0; i < num; i++))
; store[label]
[id]
= score;
break
;case2:
cin >> label >> id;
q.erase()
;break
;case3:
int max_num;
vector<
int>
require
(m);
vectorint>>
ans(m)
; cin >> max_num;
for(
int j =
0; j < m; j++
)int count =0;
for(
auto
& it : q)
if(require[it.label]
>0)
}for
(int j =
0; j < m; j++
)for
(int it : ans[j]
) cout << endl;}}
}}

3.區塊鏈

// project2.cpp : 此檔案包含 "main" 函式。程式執行將在此處開始並結束。

//#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using
namespace std;
bool
tochange
(vector<
int>
& old, vector<
int>
& newone)
intmain()
int delay;
cin >> delay >> times; string str;
while
(times--
)//再增加
for(
int aaa : iii.second.second)
//傳播
if(flag ||
!iii.second.second.
empty()
)}}}
}//注意這裡要刪除前面時刻的，記住這裡的用法
store.
erase
(store.
begin()
,store.
upper_bound
(t))
;int nn = ans[node]
.size()
; cout << nn;
for(
int ccc : ans[node]
) cout << endl;
}else
}}

上述程式中刪除map的小於等於某元素的方法使用了map的upper_bound

for

(iterator iter=maptest.
begin()
;iter!=maptest.
end();
)

191005CSP模擬題解

t1 對於每條邊，求刪了這條邊原圖能否成為二分圖，點邊規模2e6 解法 首先判掉無奇環和乙個奇環的情況 一條邊合法當且僅當其屬於所有奇環的交集且不屬於任何乙個偶環 會構成新的奇環 那就弄個dfs樹，對於每條返祖邊樹上差分一下，奇環 1偶環 1，最後看差分值是否為奇環個數即可 code include...

歷屆CSP真題題解 CSP刷真題之路

2020 12 題目編號 題解鏈結 csp202012 1 期末 之安全指數 csp202012 1 期末 之安全指數題解 csp202012 2 期末 之最佳閾值 csp202012 2 期末 之最佳閾值題解 csp202012 3 帶配額的檔案系統 csp202012 3 帶配額的檔案系統題解 ...

第21次CSP認證 題解

按照題意直接求和即可 include define n 1100000 define db double define ll long long define ldb long double define ull unsigned long long using namespace std cons...