# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120943 | 2019-06-25T19:33:40 Z | kimbj0709 | Ispit (COCI19_ispit) | C++17 | 59 ms | 1160 KB |
#include <bits/stdc++.h> using namespace std; bool find(vector<char> vect1,vector<char> vect2){ for(int i=0;i<vect1.size();i++){ if(vect1[i]!=vect2[i]){ return 0; } } return 1; //1 is same 0 is different } int find2(vector<char> vect1,vector<char> vect2){ int startpos = INT_MAX; int endpos = INT_MAX; for(int i=0;i<vect1.size();i++){ if(vect1[i]!=vect2[i]){ startpos = i; break; } } for(int i=vect1.size()-1;i>=0;i--){ if(vect1[i]!=vect2[i]){ endpos = i; break; } } if(startpos==INT_MAX){ return 0; } else{ return endpos-startpos+1; } } int main() { char input; int width,height; int contig; //vect1 is unsorted //vect2 is sorted vector<vector<char> > vect1(501); vector<vector<char> > vect2(501); cin >> width >> contig; for(int i=0;i<width;i++){ for(int j=0;j<width;j++){ cin >> input; vect1[i].push_back(input); } vect2[i] = vect1[i]; sort(vect2[i].begin(),vect2[i].end()); } for(int i=0;i<width;i++){ for(int j=i+1;j<width;j++){ if(find(vect2[i],vect2[j])==0){ continue; } else{ int k = find2(vect2[i],vect2[j]); if(k<=contig){ cout << "DA"; return 0; } } } } cout << "NE"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Incorrect | 2 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 2 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Incorrect | 5 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 384 KB | Output is correct |
2 | Correct | 7 ms | 384 KB | Output is correct |
3 | Incorrect | 5 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 512 KB | Output is correct |
2 | Correct | 7 ms | 384 KB | Output is correct |
3 | Incorrect | 5 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Incorrect | 5 ms | 512 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 888 KB | Output is correct |
2 | Correct | 36 ms | 888 KB | Output is correct |
3 | Incorrect | 23 ms | 1160 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 43 ms | 888 KB | Output is correct |
2 | Correct | 28 ms | 868 KB | Output is correct |
3 | Incorrect | 23 ms | 1016 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 888 KB | Output is correct |
2 | Correct | 59 ms | 888 KB | Output is correct |
3 | Incorrect | 23 ms | 1152 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |