Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
100%
Correctness
100%
Performance
100%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
vector<int> solution(string &S, vector<int> &P, vector<int> &Q);
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as a vector of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 26 minutes
Notes
not defined yet
Task timeline
Code: 13:12:59 UTC,
java,
autosave
Code: 13:13:05 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor.push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:14:05 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<i> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor.push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:14:24 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<pairt<> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor.push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:14:34 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<pairt<> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor[].push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:14:54 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<pair<> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor[].push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:15:05 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> impact_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor[].push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:15:18 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor;
vector<int> A_factor;
vector<int> A_factor;
vector<int> A_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor[].push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:15:35 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor;
vector<int> C_factor;
vector<int> G_factor;
vector<int> T_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
impact_factor[].push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:15:45 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor;
vector<int> C_factor;
vector<int> G_factor;
vector<int> T_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor.push_back(1);
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:15:56 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor;
vector<int> C_factor;
vector<int> G_factor;
vector<int> T_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[] = 1;
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:16:13 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor;
vector<int> G_factor;
vector<int> T_factor;
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1;
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:16:23 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1;
}else if(S[i] == 'C'){
impact_factor.push_back(2);
}else if(S[i] == 'G'){
impact_factor.push_back(3);
}else if(S[i] == 'T'){
impact_factor.push_back(4);
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:16:37 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1;
}else if(S[i] == 'C'){
C_factor[i] = 1;
}else if(S[i] == 'G'){
G_factor[i] = 1;
}else if(S[i] == 'T'){
T_factor[i] = 1;
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
for(int j=left; j<=right; j++){
min_val = min(impact_factor[j], min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:16:49 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1;
}else if(S[i] == 'C'){
C_factor[i] = 1;
}else if(S[i] == 'G'){
G_factor[i] = 1;
}else if(S[i] == 'T'){
T_factor[i] = 1;
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_)
res.push_back(min_val);
}
return res;
}
Code: 13:17:19 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1; //1
}else if(S[i] == 'C'){
C_factor[i] = 1; //2
}else if(S[i] == 'G'){
G_factor[i] = 1; // 3
}else if(S[i] == 'T'){
T_factor[i] = 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[] - )
res.push_back(min_val);
}
return res;
}
Code: 13:17:31 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] = 1; //1
}else if(S[i] == 'C'){
C_factor[i] = 1; //2
}else if(S[i] == 'G'){
G_factor[i] = 1; // 3
}else if(S[i] == 'T'){
T_factor[i] = 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:18:18 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] += 1; //1
}else if(S[i] == 'C'){
C_factor[i] = 1; //2
}else if(S[i] == 'G'){
G_factor[i] = 1; // 3
}else if(S[i] == 'T'){
T_factor[i] = 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:23:29 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] += 1; //1
}else if(S[i] == 'C'){
C_factor[i] += 1; //2
}else if(S[i] == 'G'){
G_factor[i] = 1; // 3
}else if(S[i] == 'T'){
T_factor[i] = 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:23:39 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor[i] += 1; //1
}else if(S[i] == 'C'){
C_factor[i] += 1; //2
}else if(S[i] == 'G'){
G_factor[i] += 1; // 3
}else if(S[i] == 'T'){
T_factor[i] += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:30:39 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor += 1; //1
}else if(S[i] == 'C'){
C_factor[i] += 1; //2
}else if(S[i] == 'G'){
G_factor[i] += 1; // 3
}else if(S[i] == 'T'){
T_factor[i] += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:30:50 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor += 1; //1
}else if(S[i] == 'C'){
C_factor += 1; //2
}else if(S[i] == 'G'){
G_factor += 1; // 3
}else if(S[i] == 'T'){
T_factor += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:31:21 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int A_
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor += 1; //1
}else if(S[i] == 'C'){
C_factor += 1; //2
}else if(S[i] == 'G'){
G_factor += 1; // 3
}else if(S[i] == 'T'){
T_factor += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:31:52 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = ;
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor += 1; //1
}else if(S[i] == 'C'){
C_factor += 1; //2
}else if(S[i] == 'G'){
G_factor += 1; // 3
}else if(S[i] == 'T'){
T_factor += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:32:03 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
A_factor += 1; //1
}else if(S[i] == 'C'){
C_factor += 1; //2
}else if(S[i] == 'G'){
G_factor += 1; // 3
}else if(S[i] == 'T'){
T_factor += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:32:17 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:32:28 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> A_factor(len_S, 0);
vector<int> C_factor(len_S, 0);
vector<int> G_factor(len_S, 0);
vector<int> T_factor(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
A_factor
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:32:58 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[]
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:33:24 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(A_factor[right] - A_factor[left])
res.push_back(min_val);
}
return res;
}
Code: 13:33:35 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(impact_A[right] - impact_A[left])
res.push_back(min_val);
}
return res;
}
Code: 13:33:56 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if(impact_A[right] - impact_A[left-1])
res.push_back(min_val);
}
return res;
}
Code: 13:34:27 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0)
res.push_back(min_val);
}
return res;
}
Code: 13:34:42 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
return 1;
}else if()
res.push_back(min_val);
}
return res;
}
Code: 13:34:52 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
return 1;
}else if((impact_C[right] - impact_C[left-1]) >0)
res.push_back(min_val);
}
return res;
}
Code: 13:35:06 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
return 1;
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}
res.push_back(min_val);
}
return res;
}
Code: 13:35:19 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}else if((impact_C[right] - impact_C[left-1]) >0){
return 2;
}
res.push_back(min_val);
}
return res;
}
Code: 13:35:50 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
break;
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
break;
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
break;
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(4);
break;
}
res.push_back(min_val);
}
return res;
}
Code: 13:36:01 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
break;
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
break;
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
break;
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
break;
}
res.push_back(min_val);
}
return res;
}
Code: 13:36:06 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
break;
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
break;
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
break;
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
break;
}
}
return res;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [2] expected [2, 4, 1]
Code: 13:36:27 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
}
return res;
}
Code: 13:36:56 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
return;
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
}
return res;
}
Code: 13:37:07 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
}
return res;
}
Code: 13:37:26 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
res.push_back(1);
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
res.push_back(1);
}
return res;
}
Code: 13:37:46 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min()
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
res.push_back(min_val);
}
return res;
}
Code: 13:37:59 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
res.push_back(2);
}else if((impact_G[right] - impact_G[left-1]) >0){
res.push_back(3);
}else if((impact_T[right] - impact_T[left-1]) >0){
res.push_back(4);
}
res.push_back(min_val);
}
return res;
}
Code: 13:38:09 UTC,
cpp,
autosave
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
min_val = min(2 , min_val);
}else if((impact_G[right] - impact_G[left-1]) >0){
min_val = min(3 , min_val);
}else if((impact_T[right] - impact_T[left-1]) >0){
min_val = min(4 , min_val);
}
res.push_back(min_val);
}
return res;
}
Code: 13:38:13 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A, cum_C, cum_G, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
min_val = min(2 , min_val);
}else if((impact_G[right] - impact_G[left-1]) >0){
min_val = min(3 , min_val);
}else if((impact_T[right] - impact_T[left-1]) >0){
min_val = min(4 , min_val);
}
res.push_back(min_val);
}
return res;
}
Analysis
Code: 13:38:39 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A = 0, cum_C = 0, cum_G = 0, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
min_val = min(2 , min_val);
}else if((impact_G[right] - impact_G[left-1]) >0){
min_val = min(3 , min_val);
}else if((impact_T[right] - impact_T[left-1]) >0){
min_val = min(4 , min_val);
}
res.push_back(min_val);
}
return res;
}
Analysis
Code: 13:38:50 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A = 0, cum_C = 0, cum_G = 0, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
min_val = min(2 , min_val);
}else if((impact_G[right] - impact_G[left-1]) >0){
min_val = min(3 , min_val);
}else if((impact_T[right] - impact_T[left-1]) >0){
min_val = min(4 , min_val);
}
res.push_back(min_val);
}
return res;
}
Analysis
Code: 13:38:55 UTC,
cpp,
final,
score:
100
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(string &S, vector<int> &P, vector<int> &Q) {
// write your code in C++14 (g++ 6.2.0)
int len_S = S.length(); //string 길이
int len_P = P.size();
int len_Q = Q.size();
int cum_A = 0, cum_C = 0, cum_G = 0, cum_T = 0;
vector<int> impact_A(len_S, 0);
vector<int> impact_C(len_S, 0);
vector<int> impact_G(len_S, 0);
vector<int> impact_T(len_S, 0);
vector<int> res;
for(int i=0; i<len_S; i++){
if(S[i] == 'A'){
cum_A += 1; //1
}else if(S[i] == 'C'){
cum_C += 1; //2
}else if(S[i] == 'G'){
cum_G += 1; // 3
}else if(S[i] == 'T'){
cum_T += 1; // 4
}
impact_A[i] = cum_A;
impact_C[i] = cum_C;
impact_G[i] = cum_G;
impact_T[i] = cum_T;
}
for(int i=0; i<len_P; i++){
int left = P[i];
int right = Q[i];
int min_val = 5;
if((impact_A[right] - impact_A[left-1]) >0){
min_val = min(1 , min_val);
}else if((impact_C[right] - impact_C[left-1]) >0){
min_val = min(2 , min_val);
}else if((impact_G[right] - impact_G[left-1]) >0){
min_val = min(3 , min_val);
}else if((impact_T[right] - impact_T[left-1]) >0){
min_val = min(4 , min_val);
}
res.push_back(min_val);
}
return res;
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
OK