# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
249393 | 2020-07-14T20:50:02 Z | blacktulip | Cambridge (info1cup18_cambridge) | C++17 | 2000 ms | 7596 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; PII p[li]; //~ vector<PII> v; int main(void){ scanf("%d %d",&n,&m); FOR scanf("%lld %lld",&p[i].se,&p[i].fi); for(int i=1;i<=m;i++){ int x,y; scanf("%d %d",&x,&y); vector<PII> v; for(int j=x;j<=y;j++){ v.pb(p[j]); } sort(v.begin(),v.end()); cev=0; flag=0; for(int j=x;j<=y;j++){ cev+=v[j-x].se; //~ cout<<cev<<" : : " if(cev>=v[j-x].fi){flag=1;break;} } printf("%d\n",!flag); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 39 ms | 4296 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 4 ms | 896 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 635 ms | 1308 KB | Output is correct |
4 | Correct | 1263 ms | 1552 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 39 ms | 4296 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 4 ms | 896 KB | Output is correct |
6 | Correct | 635 ms | 1308 KB | Output is correct |
7 | Correct | 1263 ms | 1552 KB | Output is correct |
8 | Execution timed out | 2083 ms | 7596 KB | Time limit exceeded |
9 | Halted | 0 ms | 0 KB | - |