제출 #289916

#제출 시각아이디문제언어결과실행 시간메모리
289916khangal로봇 (IOI13_robots)C++14
0 / 100
59 ms59384 KiB
#include<bits/stdc++.h> #include "robots.h" #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long ll; typedef double db; typedef pair<ll,ll> pl; typedef vector<ll> vl; typedef vector<vl> vvl; #define po pop_back #define pb push_back #define mk make_pair #define mt make_tuple #define lw lower_bound #define up upper_bound #define ff first #define ss second #define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); #define MOD 1000000007 #define MAX 1e18 #define MIN -1e18 #define rep(i,a,b) for(ll i=a;i<=b;i++) #define per(i,a,b) for(ll i=b;i>=a;i--) #define con continue #define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout); #define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628 #define read(x) scanf("%lld",&x); #define print(x) printf("%lld ",x); #define endl '\n'; typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set; typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; // template< typename T> // using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z; bool used[1234567]; vector<int> v[1234567],vec,vv1,vv2; string s1,s; // int sz[1234567],par[1234567]; int tr[5234567]; ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123]; map<ll,ll> mp; int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){ sort(X,X+A); sort(Y,Y+B); for(int i=0;i<T;i++){ if(A>0&&B>0){ if(X[A-1] <= W[i] && Y[B-1] <= S[i])return -1; } if(A==0){ if(Y[B-1] <= S[i])return -1; } if(B==0){ if(X[A-1] <= W[i])return -1; } } int day=0; int done=0; while(done < T){ day++; for(int i=0;i<A;i++){ int max_id = MIN, max_size = MIN; for(int j = 0; j < T ;j++){ if(used[j]==0 && X[i] < W[j] && max_size < S[j]){ max_size = S[j]; max_id = j; } } if(max_id!=MIN){ used[max_id]=1; done++; } } for(int i=0;i<B;i++){ int max_id = MIN, max_weigh = MIN; for(int j = 0; j < T ;j++){ if(used[j]==0 && Y[i] < S[j] && max_weigh < X[j]){ max_weigh = X[j]; max_id = j; } } if(max_id!=MIN){ used[max_id]=1; done++; } } } return day; }

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

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
   23 | #define MIN -1e18
      |             ^~~~~
robots.cpp:63:26: note: in expansion of macro 'MIN'
   63 |             int max_id = MIN, max_size = MIN;
      |                          ^~~
robots.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
   23 | #define MIN -1e18
      |             ^~~~~
robots.cpp:63:42: note: in expansion of macro 'MIN'
   63 |             int max_id = MIN, max_size = MIN;
      |                                          ^~~
robots.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
   23 | #define MIN -1e18
      |             ^~~~~
robots.cpp:76:26: note: in expansion of macro 'MIN'
   76 |             int max_id = MIN, max_weigh = MIN;
      |                          ^~~
robots.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
   23 | #define MIN -1e18
      |             ^~~~~
robots.cpp:76:43: note: in expansion of macro 'MIN'
   76 |             int max_id = MIN, max_weigh = MIN;
      |                                           ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...