제출 #460533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
460533		idas	Fountain (eJOI20_fountain)	C++11	0 / 100	84 ms	5016 KiB

fountain

#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define SZ(x) ((int)((x).size()))
#define LE(vec) vec[vec.size()-1]
#define TSTS int t; cin >> t; while(t--)solve()

const int INF = 1e9;
const long long LINF = 1e18;
const long double PI = asin(1)*2;
const int MOD = 1e9+7;

using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
typedef long double ld;

void setIO()
{
    FAST_IO;
}

void setIO (string s) {
    setIO();
 	freopen((s+".in").c_str(),"r",stdin);
 	freopen((s+".out").c_str(),"w",stdout);
}

const int N=1e5+10, Q=2e5+10;
int n, q, d[N], c[N], p[N];

int main()
{
    setIO();
    cin >> n >> q;
    FOR(i, 0, n) cin >> d[i] >> c[i];
    FOR(i, 1, n+1)
    {
        p[i]=p[i-1]+c[i-1];
    }

    FOR(i, 0, q)
    {
        int x, q;
        cin >> x >> q;
        //q+=p[x];
        int l=x, r=n;
        while(l<r){
            int m=(l+r+1)/2;
            if(p[m]<=q-p[x-1]) l=m;
            else r=m-1;
        }

        cout << (l>n?0:l) << "\n";
    }
}

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

fountain.cpp: In function 'void setIO(std::string)':
fountain.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fountain.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   freopen((s+".out").c_str(),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40