# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
655001 | 2022-11-02T11:36:01 Z | _Knyaz_ | Programiranje (COCI17_programiranje) | C++17 | 3000 ms | 508 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; #define int ll #define all(x) (x).begin(),(x).end() const int mod = 1e9+7; const double PI = acos( -1. ); void in(){ freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); } void solve(){ //in(); string s; cin >> s; int q; cin >> q; while(q--){ string x, y; int a, b, c, d; cin >> a >> b >> c >> d; x = s.substr(a-1, b-a+1); y = s.substr(c-1, d-c+1); sort(all(x)); sort(all(y)); size_t found = y.find(x); cout << (found!=string::npos?"DA\n":"NE\n"); } } signed main(){ cin.tie(0)->sync_with_stdio(0); int t; t = 1; //cin >> t; while(t--) solve(); } /* ██╗ ██╗███╗ ██╗██╗ ██╗ █████╗ ███████╗ ██║ ██╔╝████╗ ██║╚██╗ ██╔╝██╔══██╗╚══███╔╝ █████╔╝ ██╔██╗ ██║ ╚████╔╝ ███████║ ███╔╝ ██╔═██╗ ██║╚██╗██║ ╚██╔╝ ██╔══██║ ███╔╝ ███████╗██║ ██╗██║ ╚████║ ██║ ██║ ██║███████╗███████╗ ╚══════╝╚═╝ ╚═╝╚═╝ ╚═══╝ ╚═╝ ╚═╝ ╚═╝╚══════╝╚══════╝ */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 340 KB | Output is correct |
2 | Correct | 26 ms | 360 KB | Output is correct |
3 | Correct | 25 ms | 320 KB | Output is correct |
4 | Correct | 25 ms | 340 KB | Output is correct |
5 | Correct | 26 ms | 372 KB | Output is correct |
6 | Execution timed out | 3063 ms | 468 KB | Time limit exceeded |
7 | Execution timed out | 3060 ms | 508 KB | Time limit exceeded |
8 | Execution timed out | 3062 ms | 504 KB | Time limit exceeded |
9 | Execution timed out | 3078 ms | 500 KB | Time limit exceeded |
10 | Execution timed out | 3079 ms | 500 KB | Time limit exceeded |