Submission #595310

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...) fprintf(stderr, s)

template<class T> inline void amin(T &a, const T &b) { if (b<a) a=b; }
template<class T> inline void amax(T &a, const T &b) { if (a<b) a=b; }

int N;

struct Data {
    int tm;
    int id, op;
    Data(){}
    Data(int t, int i, int o) {
	tm = t;
	id = i;
	op = o;
    }
    bool operator<(const Data &y) const{
	return tm < y.tm;
    }
	
} D[200111];

double L[100111], H[100111];

int main() {
    scanf("%d", &N);
    REP (i, N) {
	int s, t;
	scanf("%d%d", &s, &t);
	D[2*i] = Data(s, i, 0);
	D[2*i+1] = Data(t, i, 1);
    }

    sort(D, D+2*N);
    int in = 0;
    double sum = 0, rate = 1;
    REP (i, 2*N) {
	if (D[i].op == 0) {
	    L[D[i].id] = sum;
	    H[D[i].id] = rate;
	    in++;
	} else {
	    double g = 1.0 / in;
				    
	    // eprintf("%f %f\n", L[D[i].id], H[D[i].id]);
	    L[D[i].id] = (sum - L[D[i].id]) / H[D[i].id];
	    H[D[i].id] = 1.0 - L[D[i].id] - g * rate / H[D[i].id];
	    
	    sum += rate * g;
	    rate *= 1 - g;
	    in--;
	    if (in == 0) rate = 1;
	}
    }

    REP (i, N) {
	amin(L[i], 1.0);
	amin(H[i], 1.0);
	amax(L[i], 0.0);
	amax(H[i], 0.0);
	printf("%.9f %.9f\n", L[i], H[i]);
    }

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:42:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result