# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
646576 | 2022-09-30T07:32:16 Z | lis05st | Floppy (RMI20_floppy) | C++17 | 190 ms | 4912 KB |
#include <stdlib.h> #include <string.h> #include "floppy.h" #include<bits/stdc++.h> using namespace std; const int BITS=17; string tostr(int x){ string res; for(int i=BITS-1;i>=0;i--){ res+='0'+((x>>i)&1); } return res; } int fromstr(string s){ int res=0; for(int i=0;i<BITS;i++){ res<<=1; res+=s[i]-'0'; } return res; } void read_array(int subtask_id, const std::vector<int> &v) { vector<int>vec; map<int,int>mp; for(auto e:v)vec.push_back(e); sort(vec.begin(),vec.end()); for(auto e:vec){ if(mp.count(e))continue; mp[e]=mp.size(); } string s; for(auto e:v)s+=tostr(mp[e]); save_to_floppy(s); } std::vector<int> solve_queries(int subtask_id, int N, const std::string &bits, const std::vector<int> &a, const std::vector<int> &b) { vector<int>numbers; for(int i=0;i<bits.size();i+=BITS){ numbers.push_back(fromstr(bits.substr(i,BITS))); } std::vector<int> answers; for(int i=0;i<a.size();i++){ answers.push_back(max_element(numbers.begin()+a[i],numbers.begin()+b[i]+1)-numbers.begin()); } return answers; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 664 KB | Output is correct |
2 | Correct | 3 ms | 672 KB | Output is correct |
3 | Correct | 2 ms | 672 KB | Output is correct |
4 | Correct | 2 ms | 664 KB | Output is correct |
5 | Correct | 3 ms | 672 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 122 ms | 3716 KB | Partially correct |
2 | Partially correct | 111 ms | 3808 KB | Partially correct |
3 | Partially correct | 190 ms | 3732 KB | Partially correct |
4 | Partially correct | 155 ms | 3804 KB | Partially correct |
5 | Partially correct | 110 ms | 3720 KB | Partially correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 51 ms | 4912 KB | L is too large |
2 | Halted | 0 ms | 0 KB | - |