Submission #477811

#	Time	Username	Problem	Language	Result	Execution time	Memory
477811		sumit_kk10	Walking (NOI12_walking)	C++14	0 / 25	1 ms	336 KiB

walking

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int len, n, tim[N], v[N], ans;

void solve(){
    cin >> len >> n;
    for(int i = 1; i <= n; ++i)
        cin >> tim[i] >> v[i]; 
    for(int i = 1; i <= n; ++i){
        int res = 0;
        long double cur = (ld) ((ld) len/(ld) v[i]) + tim[i];
        for(int j = 1; j <= n; ++j){
            if(i == j) continue;
            if(tim[i] < tim[j])
                if(cur > ((ld) ((ld) len / (ld) v[j]) + tim[j]))
                    ++res;
        }
        ans = max(ans, res);
    }
    cout << ans + 1 << "\n";
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 5
• Subtask 4: 0 / 7
• Subtask 5: 0 / 7