제출 #746894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
746894		anusha777	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	11 ms	208 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#define fast 			ios::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL)
#define sz(x)			(int)((x).size())
#define pb				push_back
#define vi				vector<int>
#define vb				vector<bool>
#define vvb				vector<vb>
#define pi				pair<int,int>
#define vpi				vector<pi>
#define vvi				vector<vi>
#define vc				vector<char>
#define all(x)			x.begin(), x.end()
#define rall(x)			x.rbegin(), x.rend()
#define pbb()			pop_back()
#define f				first
//#define s				second
#define ll				long long
//#define int				long long
#define ull				unsigned long long
#define forr(i, a, b)	for(int i=a; i<b; i++)
const int N=120000+1, mod=1e9 + 9, inf=1e27+1;
using namespace std;
//vi dx= { 0, 1, 0 , -1} , dy= {-1,0, 1, 0};
void solve2(int n, int k, ll a , int s)
{
    vector<ull> p(n+1);
    forr(i, 1, n+1) p[i]= p[i-1] + skim(i);
    forr(i, k, n+1) if(p[i]-p[i-k]>=a and p[i]-p[i-k]<=2ull*a)
        {
            vi v;
            forr(j, i-k+1, i+1) v.pb(j);
            answer(v);
        }
    impossible();
}
void solve(int n, int k, ll a , int s)
{
    if(n==s) solve2(n, k,a ,s);
}
//signed main()
//{
//	fast;
//	int t;
//	t=1;
//	//cin>>t;
//	while(t--) task();
//}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp:22:44: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+27' to '2147483647' [-Woverflow]
   22 | const int N=120000+1, mod=1e9 + 9, inf=1e27+1;
      |                                        ~~~~^~
books.cpp: In function 'void solve2(int, int, long long int, int)':
books.cpp:29:35: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long unsigned int>, long long unsigned int>::value_type' {aka 'long long unsigned int'} and 'long long int' [-Wsign-compare]
   29 |     forr(i, k, n+1) if(p[i]-p[i-k]>=a and p[i]-p[i-k]<=2ull*a)

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20