Submission #96106

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
96106	2019-02-05 21:16:12	gs14004	Split the sequence (APIO14_sequence)	C++17	100 / 100	150 ms	6348 KiB

sequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<lint, int> pi;
const int MAXN = 100005;
struct line{ lint x, y; int cnt, idx; };
struct cht{
  vector<line> v;
  int p = 0;
  void clear(){ v.clear(); p = 0; }
  bool bad(line x, line y, line z){
    return (llf)(x.y - y.y) / (y.x - x.x) >= (llf)(z.y - y.y) / (y.x - z.x);
  }
  void add(line l){
    if(v.size() > p && v.back().x == l.x){
      if(l.y < v.back().y) l = v.back();
      v.pop_back();
    }
    while(v.size() >= p + 2 && bad(v[v.size()-2], v.back(), l)){
      v.pop_back();
    }
    v.push_back(l);
  }
  tuple<lint, int, int> query(lint x){
    while(p + 1 < v.size() && v[p].x * x + v[p].y <= v[p+1].x * x + v[p+1].y) p++;
    return make_tuple(v[p].x * x + v[p].y, v[p].cnt, v[p].idx);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

sequence.cpp: In member function 'void cht::add(line)':
sequence.cpp:18:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(v.size() > p && v.back().x == l.x){
      ~~~~~~~~~^~~
sequence.cpp:22:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(v.size() >= p + 2 && bad(v[v.size()-2], v.back(), l)){
         ~~~~~~~~~^~~~~~~~
sequence.cpp: In member function 'std::tuple<long long int, int, int> cht::query(lint)':
sequence.cpp:28:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(p + 1 < v.size() && v[p].x * x + v[p].y <= v[p+1].x * x + v[p+1].y) p++;
         ~~~~~~^~~~~~~~~~
sequence.cpp: In function 'void printv(std::vector<int>)':
sequence.cpp:60:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<v.size(); i++){
               ~^~~~~~~~~
sequence.cpp:64:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i+1<v.size(); i++) printf("%d ", v[i]);
               ~~~^~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:83:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(l.size() == k + 1) printv(l);
     ~~~~~~~~~^~~~~~~~
sequence.cpp:84:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(r.size() == k + 1) printv(r);
     ~~~~~~~~~^~~~~~~~
sequence.cpp:85:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i+1<r.size(); i++){
               ~~~^~~~~~~~~
sequence.cpp:87:53: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(l[idx] >= r[i+1] && (i + 1) + (l.size() - idx) == k + 1){
                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
sequence.cpp:90:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=idx; j<l.size(); j++) v.push_back(l[j]);
                   ~^~~~~~~~~
sequence.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&k); k++;
  ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&t);
   ~~~~~^~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 17 / 17
• Subtask 5: 21 / 21
• Subtask 6: 29 / 29