Submission #9471

#TimeUsernameProblemLanguageResultExecution timeMemory
9471roott76N-orthotope (kriii2_N)C++98
0 / 4
0 ms1672 KiB
#include <iostream> #include <algorithm> using namespace std; int main() { int N; cin >> N; int A[24], B[24]; for(int i=0; i<N*2; i++) cin >> A[i]; for(int i=0; i<N*2; i++) cin >> B[i]; int cnt = 0; for(int i=0; i<N*2; i+=2) { int S = max(A[0], B[0]), E = min(A[1], B[1]); if(S < E) cnt++; } if(cnt == 0) cout << "-1"; else cout << cnt; cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...