Zengtudor/alg2025
1
0
Fork 0
mirror of https://gitcode.com/Zengtudor/alg2025.git synced 2025-09-05 17:50:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
Zengtudor 2025-08-23 11:18:42 +08:00
parent 42fd440053
commit 75cc4f03e5
1 changed files with 11 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
src/8/23/discrete.cpp
View File

@ -1,26 +1,27 @@
#include <algorithm> #include <algorithm>
#include <cstdint> #include <cstdint>
#include <iostream> #include <iostream>
#include <tuple>
#include <vector> #include <vector>
using ll = int64_t; using ll = int64_t;
#define gop(i,j)(std::get<j>(ops[i]))
int main(){ int main(){
ll m; ll m;
std::cin>>m; std::cin>>m;
std::vector<ll> arr; std::vector<ll> arr;
std::vector<std::tuple<ll,ll,ll>> ops(m+1);
arr.reserve(m); arr.reserve(m);
for(ll i=1;i<=m;i++){ for(ll i=1;i<=m;i++){
ll op; std::cin>>gop(i,0);
std::cin>>op; if(gop(i,0)==1){
if(op==1){ std::cin>>gop(i,1)>>gop(i,2);
ll x,y; arr.push_back(gop(i,1));
std::cin>>x>>y;
arr.push_back(x);
}else { }else {
ll x,y; std::cin>>gop(i,1)>>gop(i,2);
std::cin>>x>>y; arr.push_back(gop(i,1));
arr.push_back(x); arr.push_back(gop(i,2));
arr.push_back(y);
} }
} }
std::sort(arr.begin(),arr.end()); std::sort(arr.begin(),arr.end());