words per minute
11
Bernat1
00:00
Speed
#include <bits/stdc++.h>
#define int long long
using namespace std;
#include <bits/stdc++.h>
#define int long long
using namespace std;
for(int i = 0;i<n;i++){
}
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
const int INF = 1e15;
const int maxN = 1e6+5;
const int mod = 1e9+7;
vector<int>a(maxN);
vector<pair<int,int>>b(maxN);
vector<vector<int>>c(n,vector<int>(m,0));
int n,m;
cin>>n>>m;
#include <bits/stdc++.h>
#define int long long
using namespace std;
a.push_back({0,0});
set<int>s;
s.insert(1);
while(q--){
for(auto x : a){
cout<<x<<" ";
cout<endl;
unordered_map<int,int>m;
m[2] = 17;
multiset<int>ms;
sort(a.begin(),a.end());
priority_queue<int>q;
auto it = ms.begin();
reverse(a.begin(),a.end());
vector<int>g[maxN];
int u,v;
cin>>u>>v;
g[v].push_back(u);
g[u].push_back(v);
cout<<"got here"<<endl;
for(int i = 0;i<n;i++){
auto it = upper_bound(a.begin(),a.end());