# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891351 | amirhoseinfar1385 | Misspelling (JOI22_misspelling) | C++17 | 293 ms | 164132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const long long maxn=500000+10,K=27,mod=1000000007;
long long ps[maxn][K],n,m;
vector<pair<long long,long long>>allq[maxn];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(long long i=0;i<m;i++){
long long u,v;
cin>>u>>v;
if(u>v){
swap(u,v);
allq[u].push_back(make_pair(v,1));
}
else{
allq[u].push_back(make_pair(v,0));
}
}
for(long long i=1;i<K;i++){
ps[1][i]=i;
}
set<pair<long long,long long>>stl,str;
for(long long i=2;i<=n;i++){
for(auto x:allq[i-1]){
if(x.second==1){
str.insert(make_pair(i-1,x.first));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |