제출 #631447

#제출 시각아이디문제언어결과실행 시간메모리
631447mdn2002Misspelling (JOI22_misspelling)C++14
0 / 100
0 ms212 KiB
#include<bits/stdc++.h> using namespace std; long long n , m , in [500005] , de [500005] , inmx [500005] , demx [500005] , mod = 1e9 + 7; long long tree [2000006][28]; int main() { cin >> n >> m; for ( int i = 1 ; i <= n ; i ++ ) { in [i] = 1e9; de [i] = 1e9; } for ( int i = 0 ; i < m ; i ++ ) { long long x , y; cin >> x >> y; if ( x < y ) { de [x] = min ( de [x] , y ); demx [x] = max ( demx [x] , y ); } if ( x > y ) { in [y] = min ( in [y] , x ); inmx [y] = max ( inmx [y] , x ); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...