제출 #165322

#제출 시각아이디문제언어결과실행 시간메모리
165322losmi247선물상자 (IOI15_boxes)C++14
0 / 100
2 ms504 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e7+67; ll n,k,l,a[N]; int delivery(int N,int K,int L,int positions[]){ n = N,k = K,l = L; for(int i = 1; i <= n; i++){ a[i] = positions[i-1]; } if(k == 1){ return n*l; } if(k == n){ return l; } } /*int main(){ }*/

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

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:8:47: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 int delivery(int N,int K,int L,int positions[]){
                                               ^
boxes.cpp:4:11: note: shadowed declaration is here
 const int N = 1e7+67;
           ^
boxes.cpp:14:17: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return n*l;
                ~^~
boxes.cpp:17:16: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
         return l;
                ^
boxes.cpp:19:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...