제출 #926222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926222		jpfr12	Lollipop (POI11_liz)	C++17	40 / 100	2068 ms	2952 KiB

liz

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
int MOD = (int)1e9+7;
int MAXN = 1e6;
 
//classes

 
 
//global
int n, k;
string str;

string sol(int& cost){
  int sum = 0;
  int left = 0;
  for(int right = 0; right < n; right++){
    sum += (str[right] == 'T'? 2: 1);
    while(sum > cost){
      sum -= (str[left] == 'T' ? 2: 1);
      left++;
    }
    if(sum == cost){
      string ans = "";
      ans += to_string(left+1) +" "+ to_string(right+1);
      return ans;
    }
  }
  return "NIE";
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("hps.in");
  //ofstream fout("hps.out");
  //stop
  cin >> n >> k >> str;
  while(k--){
    int cost;
    cin >> cost;
    cout << sol(cost) << '\n';
  }
 
  return 0;
} 

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9